#include <bits/stdc++.h>
using namespace std;
const int N = 100000; 

struct Node {
    int ls, rs, dat; 
} T[10000005]; 
int rt[200005], tot; 

int n, m; 
int a[200005]; 

int build(int l, int r) {
    int o = ++tot; if (l == r) return o; 
    int mid = l + r >> 1; T[o].ls = build(l, mid); T[o].rs = build(mid + 1, r); 
    return o; 
}
int update(int pre, int l, int r, int x) {
    int o = ++tot; T[o] = T[pre]; ++T[o].dat; 
    if (l == r) return o; 
    int mid = l + r >> 1; 
    if (x <= mid) T[o].ls = update(T[pre].ls, l, mid, x); 
    else T[o].rs = update(T[pre].rs, mid + 1, r, x); 
    return o; 
}
int query(int p, int q, int l, int r, int x, int y) {
    if (x <= l && r <= y) return T[q].dat - T[p].dat; 
    int mid = l + r >> 1, res = 0; 
    if (x <= mid) res += query(T[p].ls, T[q].ls, l, mid, x, y); 
    if (mid < y) res += query(T[p].rs, T[q].rs, mid + 1, r, x, y); 
    return res; 
}
bool find(int p, int q, int l, int r) {
    l = max(l, 0); r = min(r, N); 
    if (l > r) return 0; 
    return query(rt[p], rt[q], 1, N, l, r); 
}

int main(void) {
    scanf("%d%d", &n, &m); 
    for (int i = 1; i <= n; ++i) scanf("%d", a + i); 
    rt[0] = build(1, N); 
    for (int i = 1; i <= n; ++i) rt[i] = update(rt[i - 1], 1, N, a[i]); 
    while (m--) {
        int b, x, l, r, ans = 0; scanf("%d%d%d%d", &b, &x, &l, &r); 
        for (int i = 17; i >= 0; --i) {
            int now = ans + (((b >> i & 1) ^ 1) << i); 
            if (find(l - 1, r, now - x, now + (1 << i) - 1 - x)) ans = now; 
            else ans += ((b >> i & 1) << i); 
        }
        printf("%d\n", ans ^ b); 
    }
    return 0;
}