Given a line of text find all the three-letter words.
A line of text containing upper and lowercase alphabets and spaces. The line will contain at most 1000 characters.
The output should contain all three letter words, as they appear in the original text, one per line.
Input | Output |
---|---|
The quick brown fox jumps over the lazy dog | The fox the dog |