#include<bits/stdc++.h>

 #define ll long long

 #define lson l,m,rt<<1

 #define rson m+1,r,rt<<1|1

 using namespace std;

 const int N = 3e5+;

 const int M = 1e6+;

 ll tree[N<<];

 bool ok[N<<];

 int num[M], a[N];

 int n, m;

 void PushUp(int rt)

 {

     tree[rt] = tree[rt<<] + tree[rt<<|];

     ok[rt] = ok[rt<<] && ok[rt<<|];

 }

 void Build(int l, int r, int rt)

 {

     if(l == r)

     {

         tree[rt] = a[l];

         if(tree[rt] ==  || tree[rt] == ) ok[rt] = ;

         else ok[rt] = ;

         return ;

     }

     int m = l+r >> ;

     Build(lson);

     Build(rson);

     PushUp(rt);

 }

 ll Query(int L, int R, int l, int r, int rt)

 {

     if(L <= l && r <= R)

         return tree[rt];

     int m = l+r >> ;

     ll ans = ;

     if(L <= m) ans += Query(L,R,lson);

     if(m < R)  ans += Query(L,R,rson);

     return ans;

 }

 void Revise(int L, int R, int l, int r, int rt)

 {

     if(ok[rt]) return ;

     if(l == r)

     {

         tree[rt] = num[tree[rt]];

         if(tree[rt] ==  || tree[rt] == ) ok[rt] = ;

         return ;

     }

     int m = l+r >> ;

     if(L <= m) Revise(L,R,lson);

     if(m < R) Revise(L,R,rson);

     PushUp(rt);

 }

 int main()

 {

     ios::sync_with_stdio(false);

     cin.tie();

     cout.tie();

     memset(num, , sizeof(num));

     for(int i = ; i < M; i++)

         for(int j = i; j < M; j+=i)

                 num[j]++;

     cin >> n >> m;

     for(int i = ; i <= n; i++)

         cin >> a[i];

     Build(,n,);

     int q, l, r;

     while(m--)

     {

         cin >> q >> l >> r;

         if(q == )

             cout << Query(l,r,,n,) << endl;

         else

             Revise(l,r,,n,);

     }

     return ;

 }