Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Martian Strings

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputDuring the study of the Martians Petya clearly understood that the Martians are absolutely lazy. They like to sleep and don't like to wake up.

Imagine a Martian who has exactly *n* eyes located in a row and numbered from the left to the right from 1 to *n*. When a Martian sleeps, he puts a patch on each eye (so that the Martian morning doesn't wake him up). The inner side of each patch has an uppercase Latin letter. So, when a Martian wakes up and opens all his eyes he sees a string *s* consisting of uppercase Latin letters. The string's length is *n*.

"Ding dong!" — the alarm goes off. A Martian has already woken up but he hasn't opened any of his eyes. He feels that today is going to be a hard day, so he wants to open his eyes and see something good. The Martian considers only *m* Martian words beautiful. Besides, it is hard for him to open all eyes at once so early in the morning. So he opens two non-overlapping segments of consecutive eyes. More formally, the Martian chooses four numbers *a*, *b*, *c*, *d*, (1 ≤ *a* ≤ *b* < *c* ≤ *d* ≤ *n*) and opens all eyes with numbers *i* such that *a* ≤ *i* ≤ *b* or *c* ≤ *i* ≤ *d*. After the Martian opens the eyes he needs, he reads all the visible characters from the left to the right and thus, he sees some word.

Let's consider all different words the Martian can see in the morning. Your task is to find out how many beautiful words are among them.

Input

The first line contains a non-empty string *s* consisting of uppercase Latin letters. The strings' length is *n* (2 ≤ *n* ≤ 10^{5}). The second line contains an integer *m* (1 ≤ *m* ≤ 100) — the number of beautiful words. Next *m* lines contain the beautiful words *p*_{i}, consisting of uppercase Latin letters. Their length is from 1 to 1000. All beautiful strings are pairwise different.

Output

Print the single integer — the number of different beautiful strings the Martian can see this morning.

Examples

Input

ABCBABA

2

BAAB

ABBA

Output

1

Note

Let's consider the sample test. There the Martian can get only the second beautiful string if he opens segments of eyes *a* = 1, *b* = 2 and *c* = 4, *d* = 5 or of he opens segments of eyes *a* = 1, *b* = 2 and *c* = 6, *d* = 7.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/16/2018 07:54:53 (d3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|