Let D be a DFA with exactly three states. Suppose this DFA accepts the string 000 but not the empty string \varepsilon. What is the smallest positive integer k>3 such that D must also accept 0^{k}? (Here, exponentiation is shorthand for repetition; for example, 0^{4} represents the string 0000.)