Composite Words

A composite word is a concatenation of two-or-more other words, such that the minimum length of each constituent word is 3. Write a program which accepts a list of words and an integer M as input and prints the count of composite words which can be constructed by concatenating M or more other words which are also present in the input.

Notes

• The program should accept 2 command line arguments. The first one will be the name of the file containing the list of words. The file will contain one word per line. The second argument will be the integer M.
• M is an integer such that M >= 2.
• Each word will have a minimum length of 1 and will contain only english alphabets.
• Case insensitive comparison should be performed when testing for composite words.

Examples

The word-list file used in the examples is available here: sample.txt

1)	Input: sample.txt 2 Output: 106
2)	Input: sample.txt 3 Output: 3
3)	Input: sample.txt 4 Output: 0