Farmer John wants to collect as many different kinds of cows as he can. He already has almost every kind imaginable, and the kinds he is missing fit on a short list of N lines (1≤N≤100). The list looks like this:
Each line describes one missing kind of cow with a few adjectives. Every line uses the same number of adjectives, three in the list above. A line has between 2 and 30 adjectives.
The adjectives that can appear in a position are exactly the ones that appear in that position somewhere on the list. Above, the first position is large or small, the second is brown, white, or spotted, and the third is noisy or silent. That gives 2×3×2=12 combinations, and Farmer John has a cow for every combination except the three on his list. A large white noisy cow is one of his 9 cows. Farmer John has at most 1,000,000,000 cows.
List Farmer John's cows in alphabetical order and find the Kth one.
Take the list from the statement with K=7. Farmer John's cows in alphabetical order are:
The 7th of these is small spotted noisy.