Let $a_n$ be the number of binary strings of length $n$ that do not contain three consecutive 0s. If the recurrence is $a_n = a_{n-1} + a_{n-2} + a_{n-3}$, what are the correct initial conditions for $a_1, a_2, a_3$?