编程题：One Way In, Two Ways Out

Consider a special queue which is a linear structure that allows insertions at one end, yet deletions at both ends. Your job is to check, for a given insertion sequence, if a deletion sequence is possible. For example, if we insert 1, 2, 3, 4, and 5 in order, then it is possible to obtain 1, 3, 2, 5, and 4 as an output, but impossible to obtain 5, 1, 3, 2, and 4.

### Input Specification:

Each input file contains one test case. For each case, the first line gives 2 positive integers $$N$$ and $$K$$ ($$\le 10$$), which are the number of insertions and the number of queries, respectively. Then $$N$$ distinct numbers are given in the next line, as the insertion sequence. Finally $$K$$ lines follow, each contains $$N$$ inserted numbers as the deletion sequence to be checked.

All the numbers in a line are separated by spaces.

### Output Specification:

For each deletion sequence, print in a line yes if it is indeed possible to be obtained, or no otherwise.

### Sample Input:
in
5 4
10 2 3 4 5
10 3 2 5 4
5 10 3 2 4
2 3 10 4 5
3 5 10 4 2



### Sample Output:
out
yes
no
yes
yes








答案：若无答案欢迎评论