#include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using int64 = long long;

static int N, SZ;
static vector<int64> SM;
static vector<int> MX;
static vector<int64> TG;   // -1 = non-uniform, else uniform value

static inline int64 isqrt64(int64 x) {
    if (x < 2) return x;
    int64 r = (int64)sqrtl((long double)x);
    while (r > 0 && r * r > x) r--;
    while ((r + 1) * (r + 1) <= x) r++;
    return r;
}

static inline void put(int v, int len, int64 x) {
    SM[v] = x * len;
    MX[v] = (int)x;
    TG[v] = x;
}

static inline void push(int v, int lenL, int lenR) {
    if (TG[v] != -1) {
        put(2*v,   lenL, TG[v]);
        put(2*v+1, lenR, TG[v]);
        TG[v] = -1;
    }
}

static inline void pull(int v) {
    SM[v] = SM[2*v] + SM[2*v+1];
    MX[v] = max(MX[2*v], MX[2*v+1]);
    TG[v] = (TG[2*v] != -1 && TG[2*v] == TG[2*v+1]) ? TG[2*v] : -1;
}

void build(int v, int l, int r, const vector<int>& A) {
    if (r - l == 1) {
        int x = (l < N) ? A[l] : 0;
        SM[v] = x; MX[v] = x; TG[v] = x;
        return;
    }
    int m = (l + r) >> 1;
    build(2*v, l, m, A);
    build(2*v+1, m, r, A);
    pull(v);
}

void upd_assign(int v, int l, int r, int ql, int qr, int64 x) {
    if (qr <= l || r <= ql) return;
    if (ql <= l && r <= qr) { put(v, r - l, x); return; }
    int m = (l + r) >> 1;
    push(v, m - l, r - m);
    upd_assign(2*v, l, m, ql, qr, x);
    upd_assign(2*v+1, m, r, ql, qr, x);
    pull(v);
}

void upd_sqrt(int v, int l, int r, int ql, int qr) {
    if (qr <= l || r <= ql || MX[v] <= 1) return;
    if (ql <= l && r <= qr && TG[v] != -1) {
        put(v, r - l, isqrt64(TG[v]));
        return;
    }
    int m = (l + r) >> 1;
    push(v, m - l, r - m);
    upd_sqrt(2*v, l, m, ql, qr);
    upd_sqrt(2*v+1, m, r, ql, qr);
    pull(v);
}

int64 qry_sum(int v, int l, int r, int ql, int qr) {
    if (qr <= l || r <= ql) return 0;
    if (ql <= l && r <= qr) return SM[v];
    int m = (l + r) >> 1;
    push(v, m - l, r - m);
    return qry_sum(2*v, l, m, ql, qr) + qry_sum(2*v+1, m, r, ql, qr);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int Q;
    cin >> N >> Q;
    vector<int> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];

    SZ = 1;
    while (SZ < max(N, 1)) SZ <<= 1;
    SM.assign(2 * SZ, 0);
    MX.assign(2 * SZ, 0);
    TG.assign(2 * SZ, -1);
    build(1, 0, SZ, A);

    string out;
    out.reserve(Q * 12);
    for (int q = 0; q < Q; q++) {
        int t, l, r; cin >> t >> l >> r;
        if (t == 0) {
            out += to_string(qry_sum(1, 0, SZ, l, r));
            out += '\n';
        } else if (t == 1) {
            int x; cin >> x;
            upd_assign(1, 0, SZ, l, r, x);
        } else {
            upd_sqrt(1, 0, SZ, l, r);
        }
    }
    cout << out;
    return 0;
}