Deterministic finite automata

For Sigma={a,b}, Design DFA for the language a) L={w:(na(w)+2nb(w))mod 3<2}. b) accepting set of string over {a,b} in which anbmcl, where n , m and l is greater than equal to 1.