//#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
#include <cstdio>
#include <set>

#define DEBUG 1
#define TIME clock() / 1.0 / CLOCKS_PER_SEC

using namespace std;

const int N = (int)3e5 + 10;

int a[N];
int n, m;
int T[4 * N];
set < pair <int, int> > s;

void update(int v, int l, int r, int pos, int val) {
    if(pos < l || pos > r)
        return;
    if(l == r) {
        T[v] = val;
    } else {
        int m = (l + r) >> 1;
        update(v * 2, l, m, pos, val);
        update(v * 2 + 1, m + 1, r, pos, val);
        T[v] = T[v * 2] + T[v * 2 + 1];
    }

}

int get_sum(int v, int l, int r, int tl, int tr) {
    if(tl > r || tr < l)
        return 0;
    if(tl >= l && tr <= r)
        return T[v];
    int tm = (tl + tr) >> 1;
    return get_sum(v * 2, l, r, tl, tm) + get_sum(v * 2 + 1, l, r, tm + 1, tr);
}

void build(int v, int l, int r) {
    if(l == r) {
        T[v] = a[r];
    } else {
        int m = (l + r) >> 1;
        build(v * 2, l, m);
        build(v * 2 + 1, m + 1, r);
        T[v] = T[v * 2] + T[v * 2 + 1];
    }
}

int get_divisors(int n) {
    int cnt = 0, sq = sqrt(n);
    for(int i = 1; i <= sq; ++i) {
        cnt += (n % i == 0) ? 2 : 0;
    }
    if(sq * sq == n)
        cnt --;
    return cnt;
}

int main()
{
    #if DEBUG
        freopen("input.txt", "r", stdin);
        freopen("output.txt" , "w", stdout);
        ios_base::sync_with_stdio(false);
    #endif

    cin >> n >> m;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i];
        int divisors = get_divisors(a[i]);
        if(a[i] != divisors) {
            s.insert(make_pair(i, divisors));
        }
    }
    build(1, 1, n);

    for(int i = 0; i < m; ++i) {
        int type, l , r;
        cin >> type >> l >> r;
        if(type == 1) {
            set < pair <int, int> >:: iterator itl, itr, it;
            itl = s.lower_bound(make_pair(l, N));
            itr = s.upper_bound(make_pair(r, N));
            vector < pair <int, int> > rem;
            for(it = itl; it != itr; ++it) {
                pair <int, int> cur = *it;
                update(1, 1, n, cur.first, cur.second);
                int divisors = get_divisors(cur.second);
                if(cur.second == divisors) {
                    rem.push_back(cur);
                }
            }
            if(rem.size() != 0) {
                for(int j = 0; j < rem.size(); ++j) {
                    s.erase(rem[i]);
                }
            }

        } else {
            cout << get_sum(1, l, r, 1, n) << '\n';
        }
    }

    return 0;
}