#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

constexpr int B = 500;
int s[B][50010];
VI pos[100010];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  rep(i, n) {
    int a;
    cin >> a;
    pos[a].emplace_back(i);
    for (int d = 1; d < B; d++) {
      if (a % d == 0) s[d][i+1]++;
    }
  }
  rep(d, B) rep(i, n) s[d][i+1] += s[d][i];
  rep(_, q) {
    int l, r, k;
    cin >> l >> r >> k;
    l--;
    int ans = [&]() {
      if (k < B) return s[k][r] - s[k][l];
      int res = 0;
      for (int x = k; x <= 100000; x += k) {
        res += lower_bound(all(pos[x]), r) - lower_bound(all(pos[x]), l);
      }
      return res;
    }();
    cout << ans << '\n';
  }
}