Signboard

Someone opened a new convenience store near a school. A store's face is its signboard, and because this store is not part of a franchise, the owner has to pay for and build the signboard himself.

To save money, he decides to reuse the $N$ old signboards that the previous owner left behind. From a single old signboard he wants to erase some characters so that the remaining string is exactly the store's name. The catch is that the remaining characters must all be equally spaced: there must be some starting position and a fixed step $d \ge 1$ such that reading the character at that position and every $d$-th position afterward spells the store's name.

A new signboard must be made from a single old signboard; it cannot be cut or glued together. Even if one old signboard can produce the name in several different ways, it still counts as only one usable signboard.

Given the store's name and the old signboards, write a program that counts how many new signboards can be made.

The first line contains the number of old signboards $N$ ($1 \le N \le 100$).

The second line contains the store's name, consisting only of lowercase letters, with length between 3 and 25 inclusive.

Each of the next $N$ lines contains the string written on one old signboard. Each string consists only of lowercase letters and has length between 1 and 100 inclusive.

Print the number of new signboards that can be made.

Suppose the store's name is bar.

• On the first signboard abracadabra, keeping only the 2nd, 6th, and 10th characters (step 4) spells bar.
• On the second signboard bear, erasing the 2nd character leaves bar, but the remaining characters are not equally spaced.
• The third signboard bar can be used as is.
• On the fourth signboard baraxbara, keeping the 1st, 2nd, and 3rd characters, or the 6th, 7th, and 8th characters, spells bar.

So new signboards can be made from the first, third, and fourth signboards, and the answer is 3.