K-Kth Query_第 45 届国际大学生程序设计竞赛（ICPC）亚洲区域赛（济南）

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

题目描述

MianKing has a sequence $a_{1...n}$ and he wants to answer $Q$ queries about it.

Let $f(a,S,K)$ denote the K-th smallest number of sequence $b_{1...n}$ which satisfies that $\forall i \in [1,n], b_i=a_i~xor~S$ .

Now for each query, give you $L,R,K$ , you need to answer $Min_{S=L}^{R}f(a,S,K)$ .

输入描述:

The first line has two integers .

The second line has  integers which denote  .

Then there are  lines, the i-th line has three integers  which represents the i-th query.

输出描述:

There are  lines, the i-th line has one integer which denotes .

示例1

输入

复制

输出

复制

0
1
2

示例2

输入

复制

输出

复制