403969: GYM101375 J MaratonIME goes to Mito

On MaratonIME's first trip to Mito, a restaurant, our dearest friend Estrela displayed some trouble to walk streets with trees. Every time he walked close enough to one, something really bad happened to him.

To avoid further harm, he decided to split the sidewalk into three separate lanes called S, M and H, each one approximately one meter wide, being S the one close to the street, M the one in the middle and H the one next to the houses. You can think of the region where Estrela walks as a grid with 3 lines (the lanes S, M and H) and n columns. Estrela is placed at the beginning (meter 1) of the sidewalk and wants to walk to meter n, where Mito is located. He knows the location of all the trees on his path and wants you to tell him if he can make it there unharmed. In order to guarantee that Estrela will arrive at Mito safely, he must not walk over any of the eight cells adjacent to the trees neither on the cells where trees are located.

The positions of the trees are given ordered, in other words, if i < j, the i-th tree wont be further away from the column 1 than the j-th tree.

Estrela can start and finish his walk at any lane.

The figure exemplifies the second test case. The dashed path is the path chosen by Estrela.

In the first line there are two integers n e m the distance that Estrela wants to walk and the number of trees.

Then m lines follow, in the i-th line there is an integer a_i and a character c_i, meaning the i-th tree is in the lane c_i and in the column a_i. It is guaranteed that, if 1 ≤ i < j ≤ m, then a_i ≤ a_j, and no two trees in the input have the same lane and column.

Limits

• 3 ≤ n ≤ 10⁵.
• 1 ≤ m ≤ 10⁴.
• 1 ≤ a_i ≤ n e c₁ = S or M or H for all i.

Print "Yes" (without quotes) if Estrela can get to Mito safe and sound or "No" if not.

4 2
1 S
4 S

Yes

5 2
1 H
5 S

Yes