题目描述

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$.

输入格式

Each input file contains one test case. For each case, the first line gives $2$ positive integers $N$ and $K$ ($≤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.