MathNet 2011 Question 76

A certain language uses an alphabet containing three letters. Some sequences of two or more letters are forbidden, and every two forbidden sequences have different lengths. Prove that there exists admissible words of every length.