#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>using namespace std;int n, m, a[1000010], b[1000010], cnt, tot, c[1000100], sizee, L = 1, R = 0, tong[1000010], ans[1000010];
bool flag = true;struct node
{int l, r, p, v,id;
}e[100010];bool cmp(node a, node b)
{if (a.l / sizee == b.l / sizee)return a.r < b.r;return a.l < b.l;
}void add(int x)
{tong[a[x]]++;
}void del(int x)
{tong[a[x]]--;
}int main()
{scanf("%d%d", &n, &m);for (int i = 1; i <= n; i++)scanf("%d", &a[i]);cnt = 0;for (int i = 1; i <= m; i++){scanf("%d%d%d%d", &e[i].l, &e[i].r, &e[i].p, &e[i].v);e[i].id = i;if (i != 1 && e[i].p != e[i - 1].p)flag = false;b[++cnt] = e[i].v;}if (flag){for (int i = 1; i <= n; i++){a[i] %= e[1].p;b[++cnt] = a[i];}memcpy(c, b, sizeof(b));sort(c + 1, c + 1 + cnt);tot = unique(c + 1, c + 1 + cnt) - c - 1;for (int i = 1; i <= n; i++)a[i] = lower_bound(c + 1, c + 1 + tot, a[i]) - c - 1;for (int i = 1; i <= m; i++)e[i].v = lower_bound(c + 1, c + 1 + tot, e[i].v) - c - 1;sizee = (int)sqrt(n);sort(e + 1, e + 1 + m, cmp);for (int i = 1; i <= m; i++){int l = e[i].l, r = e[i].r;while (R < r)add(++R);while (R > r)del(R--);while (L > l)add(--L);while (L < l)del(L++);ans[e[i].id] = tong[e[i].v];}for (int i = 1; i <= m; i++)printf("%d\n", ans[i]);}else{for (int i = 1; i <= m; i++){int cnt = 0;for (int j = e[i].l; j <= e[i].r; j++)if (a[j] % e[i].p == e[i].v)cnt++;printf("%d\n", cnt);}}return 0;
}

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>using namespace std;int n, m, a[100010], maxn, block, cnt, maxx, l[10010], r[10010], ans;
int f[1010][10010], g[1010][70][70], kuai[100100];int main()
{scanf("%d%d", &n, &m);for (int i = 1; i <= n; i++){scanf("%d", &a[i]);maxn = max(maxn, a[i]);}block = 100;cnt = (n - 1) / block + 1;maxx = 60;for (int i = 1; i <= cnt; i++){l[i] = (i - 1) * block + 1, r[i] = min(n, i * block);for (int j = 0; j <= maxn; j++)f[i][j] = f[i - 1][j];for (int j = 1; j <= maxx; j++)for (int k = 0; k < maxx; k++)g[i][j][k] = g[i - 1][j][k];for (int j = l[i]; j <= r[i]; j++){kuai[j] = i;f[i][a[j]]++;for (int k = 1; k <= maxx; k++)g[i][k][a[j] % k]++;}}for (int i = 1; i <= m; i++){int ll, rr, p, v;scanf("%d%d%d%d", &ll, &rr, &p, &v);ans = 0;v %= p;int L = kuai[ll], R = kuai[rr];if (L < R){if (p <= 60)ans += g[R - 1][p][v] - g[L][p][v];elsefor (int i = v; i <= maxn; i += p)ans += f[R - 1][i] - f[L][i];for (int j = ll; j <= r[L]; j++)if (a[j] % p == v)ans++;for (int j = l[R]; j <= rr; j++)if (a[j] % p == v)ans++;}elsefor (int j = ll; j <= rr; j++)if (a[j] % p == v)ans++;printf("%d\n", ans);}return 0;
}