#include <atcoder/fenwicktree>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

const ll MX = 100'010;
void solve() {
  ll n, q;
  cin >> n >> q;
  vector<ll> a(n);
  vector<vector<ll>> is(MX);
  rep(i, n) {
    cin >> a[i];
    for (ll j = 1; j * j <= a[i]; j++) {
      if (a[i] % j)
        continue;
      is[j].push_back(i);
      if (j != a[i] / j)
        is[a[i] / j].push_back(i);
    }
  }
  vector qs(MX, vector<tuple<ll, ll, ll>>());
  rep(qi, q) {
    ll l, r, k;
    cin >> l >> r >> k;
    qs[k].emplace_back(l, r, qi);
  }
  atcoder::fenwick_tree<ll> bit(MX);
  vector<ll> ans(q, 0);
  rep(val, MX - 5) {
    if (is[val].empty() || qs[val].empty())
      continue;
    for (const auto i : is[val])
      bit.add(i, 1);
    for (const auto &[l, r, qi] : qs[val])
      ans[qi] = bit.sum(l - 1, r);
    for (const auto i : is[val])
      bit.add(i, -1);
  }
  rep(i, ans.size()) cout << ans[i] << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}