Problem Statement

Takahashi is trying to reserve a seat on a train.

There are $N$ trains he is considering as candidates for reservation, numbered $1, 2, \dots, N$. Each train has seats in five columns, called column A, column B, column C, column D, and column E.

The current seat availability information for each train is given as strings $S_1, S_2, \dots, S_N$. Here, $S_1, S_2, \dots, S_N$ all have length $5$, and columns A through E of train $i$ correspond to the first through fifth characters of $S_i$, respectively. If that character is o, there is a vacant seat in the corresponding column; if it is x, there is no vacant seat in the corresponding column.

Takahashi wants to reserve a seat in column $X$, where $X$ is one of A, B, C, D, E. Determine whether there is a vacant seat in column $X$ on at least one train.

Constraints

• $N$ is an integer between $1$ and $100$, inclusive.
• $X$ is one of A, B, C, D, E.
• $S_i$ is a string of length $5$ consisting of o and x.

Input

The input is given from Standard Input in the following format:

N X
S_1
S_2
\vdots
S_N

Output

If there is a vacant seat in column $X$ on at least one train, output Yes; otherwise, output No.