#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10, M = 1e6 + 5;
inline long long read() {
  long long x = 0;
  char c = getchar();
  while (!isdigit(c)) c = getchar();
  while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
  return x;
}
long long n, m, a[N], d[M + 5], fa[N], tre[N];
void shai() {
  for (int i = 1; i <= M; ++i)
    for (int j = i; j <= M; j += i) ++d[j];
}
inline void add(int x, long long a) {
  for (; x <= n; x += x & -x) tre[x] += a;
}
inline long long query(int x) {
  long long res = 0;
  for (; x; x -= x & -x) {
    res += tre[x];
  }
  return res;
}
int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }
signed main() {
  shai();
  int op, l, r;
  n = read();
  m = read();
  for (int i = 1; i <= n; ++i) {
    a[i] = read();
    add(i, a[i]);
    fa[i] = i;
  }
  fa[n + 1] = n + 1;
  while (m--) {
    op = read();
    l = read();
    r = read();
    if (l > r) swap(l, r);
    if (op & 1) {
      for (int i = l; i <= r;) {
        add(i, d[a[i]] - a[i]);
        a[i] = d[a[i]];
        if (a[i] <= 2) fa[i] = i + 1;
        if (i == find(i))
          ++i;
        else
          i = fa[i];
      }
    } else
      printf("%lld\n", query(r) - query(l - 1));
  }
}
