A chain of relay towers transmits text one after another: tower i sends a fixed chunk words[i], and each tower's transmission begins the instant the previous one ends, with no gaps or separators between chunks. A monitoring station recorded a transcript s, believed to start exactly at the beginning of the first tower's transmission and to stop exactly at some tower's boundary.

Given the recorded transcript and the ordered list of tower chunks, determine whether s is exactly equal to the concatenation of the first k chunks for some k between 1 and the number of towers (inclusive), with no partial chunk included and no leftover text in s.

Input format

• Line 1: the transcript string s.
• Line 2: an integer n, the number of towers.
• Line 3: n space-separated strings, words[0] through words[n-1], in transmission order.

Output format

Print true if s equals the concatenation of some prefix of words, and false otherwise.

Constraints

• 1 <= n <= 100
• 1 <= length of each words[i] <= 20
• 1 <= length of s <= 1000
• s and every words[i] consist only of lowercase English letters.

codesprint
2
code sprint

true

codesprints
2
code sprint

false