题解 | #Poi 的新加法（Easy Version）#

#include <iostream>
#include <vector>

using namespace std;

void solve() {
    int n, q;
    cin >> n >> q;
    vector<long long> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    for (int i = 0; i < q; ++i) {
        int l, r;
        cin >> l >> r;
        // 使用 long long 防止左移操作导致溢出
        long long current_result = a[l - 1];
        for (int j = l; j < r; ++j) {
            // 严格按顺序执行 f 运算
            current_result = (current_result & a[j]) << 1;
        }
        cout << current_result << endl;
    }
}

int main() {
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        while (t-- > 0) {
            solve(sc);
        }
    }

    public static void solve(Scanner sc) {
        int n = sc.nextInt();
        int q = sc.nextInt();
        long[] a = new long[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextLong();
        }

        for (int i = 0; i < q; i++) {
            int l = sc.nextInt();
            int r = sc.nextInt();
            // 使用 long 防止左移操作导致溢出
            long currentResult = a[l - 1];
            for (int j = l; j < r; j++) {
                // 严格按顺序执行 f 运算
                currentResult = (currentResult & a[j]) << 1;
            }
            System.out.println(currentResult);
        }
    }
}

def solve():
    # 读取 n 和 q
    n, q = map(int, input().split())
    # 读取数组 a
    a = list(map(int, input().split()))
    
    for _ in range(q):
        # 读取查询区间 l 和 r
        l, r = map(int, input().split())
        # Python 的整数类型自动处理大数，无需担心溢出
        current_result = a[l - 1]
        for i in range(l, r):
            # 严格按顺序执行 f 运算
            current_result = (current_result & a[i]) << 1
        print(current_result)

# 读取测试用例数
t = int(input())
for _ in range(t):
    solve()