K-Bit_2022年浙大城市学院新生程序设计竞赛（同步赛）

时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld

题目描述

$Hile$ wants to play a game with you. First, you can select a number $x$ in the range of $[0, r]$ .

Then $Hile$ will perform $n$ operations on the number $x$ you select, each of which is of one of the following three types:

$1 \ \ a$ : change $x$ to $x\ \&\ a$ , which $\&$ means bitwise AND.
$2 \ \ a$ : change $x$ to $x\ |\ a$ , which $|$ means bitwise OR.
$3 \ \ a$ : change $x$ to $x \oplus a$ , which $\oplus$ means bitwise XOR.

Assume that $y$ is obtained by $x$ after $n$ operations. $Hile$ will ask you $q$ questions. For each question, the operations are fixed, and he will give you a number $r$ --- the range. You should tell her which $x$ $(0 \le x \le r)$ you choose initially to maximize the final $y$ .

输入描述:

The first line of the input contains two integers   --- The number of operations and the number of questions.

The next  lines each line contains two integers   --- the operation type and the number.

The next  lines each line contains one integer   --- The number  gives you.

输出描述:

Output  lines --- for each , you should output which   you choose initially that  is maximize possible.  

.

示例1

输入

复制

输出

复制

说明

In the test case:

If choose , .

If choose , .

If choose , .

If choose , .

If choose , .

If choose , .

When , you can choose  or .

When , you can choose .

When , you can choose  or .