#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 1;
int d[maxn];
void sieve() {
  for (int i = 1; i < maxn; ++i) {
    for (int j = i; j < maxn; j += i) d[j]++;
  }
}
long long t_sum[maxn];
bool flag[maxn];
int a[maxn];
inline void merge(int v) {
  t_sum[v] = t_sum[v << 1] + t_sum[v << 1 | 1];
  flag[v] = flag[v << 1] & flag[v << 1 | 1];
}
bool p(int a) { return a <= 2; }
void build(int v, int tl, int tr) {
  if (tl == tr - 1) {
    t_sum[v] = a[tl];
    flag[v] = p(a[tl]);
    return;
  }
  int tm = (tl + tr) >> 1;
  build(v << 1, tl, tm);
  build(v << 1 | 1, tm, tr);
  merge(v);
}
int L, R;
long long get_sum(int v, int tl, int tr) {
  if (tl >= R || L >= tr) return 0;
  if (tl >= L && tr <= R) return t_sum[v];
  int tm = (tl + tr) >> 1;
  return get_sum(v << 1, tl, tm) + get_sum(v << 1 | 1, tm, tr);
}
void upd(int v, int tl, int tr) {
  if (tl >= R || L >= tr) {
    return;
  }
  if (tl == tr - 1) {
    a[tl] = d[a[tl]];
    t_sum[v] = a[tl];
    flag[v] = p(a[tl]);
    return;
  }
  if (tl >= L && tr <= R && flag[v]) {
    return;
  }
  int tm = (tl + tr) >> 1;
  upd(v << 1, tl, tm);
  upd(v << 1 | 1, tm, tr);
  merge(v);
}
int main() {
  sieve();
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", a + i);
  }
  build(1, 1, n + 1);
  while (m--) {
    int tp;
    scanf("%d", &tp);
    if (tp == 1) {
      int l, r;
      scanf("%d%d", &l, &r);
      L = l;
      R = r + 1;
      upd(1, 1, n + 1);
    } else {
      int l, r;
      scanf("%d%d", &l, &r);
      L = l;
      R = r + 1;
      printf("%I64d\n", get_sum(1, 1, n + 1));
    }
  }
}
