#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define fi first
#define se second
#define pb push_back
#define ii pair<int , int>
#define pq priority_queue
#define iii pair<int , pair<int , int>>
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define fod(i,r,l) for(int i=r;i>=l;i--)
#define fill(f,x) memset(f,x,sizeof(f))
#define NAME "file"

const int N = 3e5 + 5, mod = 1e9 + 7;
int n, m, A[N], bit[N], u[N], v[N], x[N], a[N], l[N], r[N], y[N];
vector <int> q[N];

struct add
{
    int i, x, u, v;
} st[N];


void upd(int x , int v)
{
   for (; x <= 1e5; x += x & -x) bit[x] += v;
}

int get(int x)
{
   int res = 0;
   for (; x > 0 ; x &= x - 1) res += bit[x];
   return res;
}

bool cmp(add a , add b)
{
    return a.x < b.x;
}


signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);  cout.tie(0);
    //freopen(NAME".INP" , "r" , stdin);
    //freopen(NAME".OUT" , "w" , stdout);

    cin >> n >> m;
    fo(i, 1, n)
        cin >> A[i];
    
    fo(i, 1, m)
    {
        cin >> u[i] >> v[i] >> x[i] >> a[i];
        st[i].i = i;
        st[i].u = u[i];
        st[i].v = v[i];
        st[i].x = x[i];
    }

    sort(st + 1 , st + m + 1 , cmp);
    int j = 0;
    fo(i, 1, m)
    {
        while (j + 1 < st[i].x)
        {
            j++;
            upd(A[j] , 1);
        }
        int k = get(st[i].v) - get(st[i].u - 1);
        a[st[i].i] += k;
    }

    fo(i, 1, 1e5) bit[i] = 0;

    //

    fo(i, 1, m)
    {
        l[i] = 1;
        r[i] = n;
        y[i] = -1;
    }

    bool run = 1;
    while (run)
    {
        run = 0;

        fo(i, 1, m)
        {
            if (l[i] <= r[i])
            {
                run = 1;
                q[(l[i] + r[i]) / 2].push_back(i);
            }
        }

        fo(mid, 1, n)
        {
            upd(A[mid] , 1);
            
            for (auto i : q[mid])
            {
                int sum = get(v[i]) - get(u[i] - 1);
                if (sum >= a[i])
                {
                    y[i] = mid;
                    r[i] = mid - 1;
                }
                else
                    l[i] = mid + 1;
            }
        }

        fo(i, 1, m) q[i].clear();
        fo(i, 1, 1e5) bit[i] = 0;
    }

    fo(i, 1, m)
        cout << y[i] << ' ';
}
// haronnee_