#include<stdio.h>

 #include<algorithm>

 #include<string.h>

 #include<math.h>

 #include<string>

 #include<iostream>

 using namespace std;

 #define N 600055

 typedef long long LL;

 int a[N],pos[N],block;

 int n,m,k,idx;

 int ans1[N],tmp[N];

 struct node

 {

     int l,r,id;

     int p;

 }q[N];

 //BZOJ 4129

 int cmp(node a,node b)

 {

     if (pos[a.l]==pos[b.l]) return a.r<b.r;

     return pos[a.l]<pos[b.l];

 }

 void solve()

 {

     int l=,r=;

     int ans=;

     for (int i=;i<=m;i++)

     {

         while (l>q[i].l)

         {

             l--;

             if (k-a[l]>) ans+=tmp[k-a[l]];

             tmp[a[l]]++;

         }

         while (r<q[i].r)

         {

             r++;

             if (k-a[r]>) ans+=tmp[k-a[r]];

             tmp[a[r]]++;

         }

         while (l<q[i].l)

         {

             if (k-a[l]>) ans-=tmp[k-a[l]];

             tmp[a[l]]--;

             l++;

         }

         while (r>q[i].r)

         {

             if (k-a[r]>) ans-=tmp[k-a[r]];

             tmp[a[r]]--;

             r--;

         }

         ans1[q[i].id]+=q[i].p*ans;

     }

 }

 int main()

 {

  while (scanf("%d%d",&n,&k)!=EOF)

  {

     memset(ans1,,sizeof(ans1));

     for (int i=;i<=n;i++)

     scanf("%d",&a[i]);

     memset(tmp,,sizeof(tmp));

     block=sqrt(n);

     for (int i=;i<=n;i++)

     pos[i]=(i-)/block+;

     idx=;

     scanf("%d",&m);

     for (int i=;i<=m;i++)

     {

       int l,r,l2,r2;

       scanf("%d%d%d%d",&l,&r,&l2,&r2);

       q[++idx].l=l;q[idx].r=r2;q[idx].id=i;q[idx].p=;

       if (r+<=l2-)

       {

           q[++idx].l=r+,q[idx].r=l2-,q[idx].id=i,q[idx].p=;

       }

       q[++idx].l=l;q[idx].r=l2-;q[idx].id=i,q[idx].p=-;

       q[++idx].l=r+;q[idx].r=r2;q[idx].id=i,q[idx].p=-;

     }

     swap(idx,m);

     sort(q+,q+m+,cmp);

     //for (int i=1;i<=m;i++) cout<<q[i].id<<" ";

    //cout<<endl;

    // cout<<m<<" "<<idx<<endl;

     solve();

     for (int i=;i<=idx;i++)

     printf("%d\n",ans1[i]);

     }

     return ;

 }