Dictionary Compression

In the menu to the right, you are able to download an English dictionary (dict.txt) containing a sorted list of words, one per line. Your task is to write a program that outputs a prefix of the dictionary that is as long as possible.


There is no input for this problem.


Output a number of lines, each containing a word from the dictionary. The words must form a prefix of the entire file.


Assume that the fraction of the words you output is $x$. Then, you will be given $500 \cdot x$ points.


Your program for this task can be at most 91000 bytes in length. This limit includes files submitted along with the program.