Problem L
Lost Map
An amateur Viking historian needs your help finding the silver left by Egill Skallagrímsson, of Egil’s saga. She has found two old treasure maps that are supposed to lead to it. A treasure map is a list of instructions of the form “direction $k$”, where direction can be “n”, “s”, “e”, or “w”. The maps are sadly old, so some of the instructions are missing and we represent them with a simple “?” instead.
The first map is larger while the second map is a smaller fragment. She wants to know how she can overlay her maps such that they coincide.
Two maps coincide if the corresponding instructions are either identical or at least one of them is lost to time. All instructions must have a corresponding instruction on the other map when overlaying the maps.
Input

The first line of the input contains two integers, $1 \leq m < n \leq 4 \cdot 10^5$.

The next $n$ lines describe the first map with each containing either “?”, or “(nsew)” followed by the number of steps $s$ $(1 \le s \le 7$).

The next $m$ lines describe the second map with each containing either “?”, or “(nsew)” followed by the number of steps $s$ $(1 \le s \le 7$).
Output
Output the number of indices such that if the second map was overlaid at this index on the first map then they would coincide.
Sample Input 1  Sample Output 1 

4 3 n 4 e 1 ? s 5 ? e 1 ? 
2 
Sample Input 2  Sample Output 2 

4 3 n 4 e 1 w 3 s 5 ? e 1 ? 
1 