#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const int INF = 0x3f3f3f3f;
int a[N];
int d[N];
long long tree[N << 2];
int mx[N << 2];
void init() {
  for (int i = 1; i < N; i++) {
    for (int j = i; j < N; j += i) d[j]++;
  }
}
void push_up(int rt) {
  mx[rt] = max(mx[rt << 1], mx[rt << 1 | 1]);
  tree[rt] = tree[rt << 1] + tree[rt << 1 | 1];
}
void build(int rt, int l, int r) {
  if (l == r) {
    tree[rt] = mx[rt] = a[l];
    return;
  }
  int m = (l + r) >> 1;
  build(rt << 1, l, m);
  build(rt << 1 | 1, m + 1, r);
  push_up(rt);
}
void update(int L, int R, int rt, int l, int r) {
  if (mx[rt] <= 2) return;
  if (l == r) {
    tree[rt] = mx[rt] = d[tree[rt]];
    return;
  }
  int m = (l + r) >> 1;
  if (L <= m) update(L, R, rt << 1, l, m);
  if (R > m) update(L, R, rt << 1 | 1, m + 1, r);
  push_up(rt);
}
long long query(int L, int R, int rt, int l, int r) {
  if (L <= l && r <= R) return tree[rt];
  int m = (l + r) >> 1;
  long long ans = 0;
  if (L <= m) ans += query(L, R, rt << 1, l, m);
  if (R > m) ans += query(L, R, rt << 1 | 1, m + 1, r);
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, t, l, r;
  init();
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> a[i];
  build(1, 1, n);
  while (m--) {
    cin >> t >> l >> r;
    if (t == 1)
      update(l, r, 1, 1, n);
    else
      cout << query(l, r, 1, 1, n) << endl;
  }
  return 0;
}
