#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  int n, q;
  cin >> n >> q;
  vector<int> a(n);
  for (int i = 0; i < n; ++i) cin >> a[i];
  vector<vector<int>> id(1e5 + 1);
  for (int i = 0; i < n; ++i)
  {
    for (int j = 1; j * j <= a[i]; ++j)
    {
      if (a[i] % j) continue;
      int v1 = j, v2 = a[i] / j;
      id[v1].push_back(i);
      if (v1 != v2) id[v2].push_back(i);
    }
  }
  while (q--)
  {
    int l, r, k;
    cin >> l >> r >> k;
    --l, --r;
    int ans = upper_bound(id[k].begin(), id[k].end(), r) - lower_bound(id[k].begin(), id[k].end(), l);
    cout << ans << endl;
  }
}