eolymp
bolt
Try our new interface for solving problems

ls

You are implementing an operating system, and now need to write a program to list files in a directory: '\textbf{ls}'. You want the user to be able to list only les that match a given pattern that can include wildcards (\textbf{*}), for example \textbf{*.c}. A wildcard matches zero or more characters of any kind. \InputFile The first line contains a string \textbf{p}, containing \textbf{1-100} characters '\textbf{a}'-'\textbf{z}', '\textbf{*}' and '\textbf{.}'. This is the pattern. The second line contains an integer \textbf{n }(\textbf{1 }≤ \textbf{n }≤ \textbf{100}), which is the number of files in the directory. Then follows \textbf{n }lines containing the names of the files in the directory. Each line is a string containing \textbf{1-100 }characters '\textbf{a}'-'\textbf{z}' and '\textbf{.}'. \OutputFile The output shall consist of the filenames that match the pattern \textbf{p}, each on its own line, in the same order that they were given as input.
Time limit 1 second
Memory limit 64 MiB
Input example #1
*.*
4
main.c
a.out
readme
yacc
Output example #1
main.c
a.out
Source 2011 Nordic Collegiate Programming Contest, 1 October, Problem E