Design a deterministic finite automaton to recognise the following language

$L=\{0^{2m}+1^{3n}+2^k|m>0,n>0,k>2\},$ where $=\{0,1,2,+\}.$

clear view of explanation with what is plus symol denotes and draw a dfa