The program has to work with huge .txt list files, so it should be fast.
In the keywords folder there are multiple .txt files, that should be processed.
.txt files will contain list like it's shown in "[login to view URL]"
Every combination should be made out of words in the line, however first word before "TAB" should not be considered.
Example for results are shown in "[login to view URL]"
If the created word length is more than indicated in the "[login to view URL]", than such combination should not be saved in results.txt. Also keywords folder destination and results destination should be indicated in "[login to view URL]".
Same combinations should be deleted from the list.