All submissions for this problem are available.
Bill has got a new iPod (Bill is passionate about listening songs. So his friend presented him a beautiful iPod on his birthday). The iPod has large collection of songs, so bill decided to sort out his favorite songs from the given collection. There are some constraints on which bill selects a particular song as favorite song.
A special pattern should get represented particular number of times in the song name. Then only Bill approves the song as his favorite song. So friends lets help Bill in developing his favorite library.
First line of input contains single integer denoting no of test cases.
For each test case first line contains N, formatted String and M.
Following N lines contains a string represented to a song in playlist.
For each test case print out strings which are chosen by Bill for his play list.
3 a%l 2
|Time Limit:||0.5 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, PYP3, CLOJ, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.