#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <deque>
#include <iomanip>
#include <cstdio>
#include <stack>
#include <numeric>
#include <cassert>
using namespace std;
typedef  long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define  MP make_pair
#define  PB push_back
#define inf 1000000007
#define mod 1000000007
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define int long long

template<typename T> class segtree {
private:
    int n,sz; vector<T> node, lazy_update, lazy_add; vector<bool> lazyFlag;
    vector<T> min_val, max_val, lazy;
    void opr(int id){
        node[id] = node[2*id+1] + node[2*id+2];
        min_val[id] = min(min_val[2*id+1],min_val[2*id+2]);
        max_val[id] = max(max_val[2*id+1],max_val[2*id+2]);
    }
public:
    segtree(vector<T> v) : sz((int)v.size()){
        n = 1;
        while(n < sz) n *= 2;
        node.resize(2*n-1, 0);
        lazy.resize(2*n-1,0);
        lazy_add.resize(2*n-1, 0);
        lazyFlag.resize(2*n-1,false);
        min_val.resize(2*n-1,numeric_limits<T>::max());
        max_val.resize(2*n-1,numeric_limits<T>::min());
        for(int i = 0; i < sz; i++){
            node[i+n-1] = min_val[i+n-1] = max_val[i+n-1] = v[i];
        }
        for(int i=n-2; i>=0; i--){
            opr(i);
        }
    }
    void eval(int k, int l, int r) {
        if(lazyFlag[k]){
            //lazy_update[k] += lazy_add[k];
            //node[k] = lazy_update[k]*(r-l);
            lazy[k] += lazy_add[k];
            
            node[k] = (r - l) * lazy[k];
            min_val[k] = max_val[k] = lazy[k];
            if(r - l > 1) {
                lazy_add[2*k+1] = lazy_add[2*k+2] = 0;
                //lazy_update[2*k+1] = lazy_update[2*k+2] = lazy_update[k];
                lazy[k*2+1] = lazy[k*2+2] = lazy[k];
                lazyFlag[k*2+1] = lazyFlag[k*2+2] = true;
            }
            lazy_add[k] = 0;
            lazyFlag[k] = false;
        }else if(lazy_add[k] != 0){
            node[k] += lazy_add[k]*(r-l);
            min_val[k] +=lazy_add[k]; max_val[k] += lazy_add[k];
            if(r - l > 1){
                lazy_add[2*k+1] += lazy_add[k]; lazy_add[2*k+2] += lazy_add[k];
            }
            lazy_add[k] = 0;
        }
    }
    // void update(int a, int b, T x, int k=0, int l=0, int r=-1) {
    //     if(r < 0) r = n;
    //     eval(k, l, r);
    //     if(b <= l || r <= a) return;
    //     if(a <= l && r <= b){
    //         lazy_add[k] = 0; lazy_update[k] = x; lazyFlag[k] = true;
    //         eval(k, l, r);
    //     }else{
    //         update(a, b, x, 2*k+1, l, (l+r)/2); update(a, b, x, 2*k+2, (l+r)/2, r);
    //         node[k] = node[2*k+1] + node[2*k+2];
    //     }
    // }
    void modulo_update(int a, int b, T x, int k=0, int l=0, int r=-1){
        if(r < 0) r = n;
        eval(k, l, r);
        if(b <= l || r <= a || max_val[k] < x){
            return;
        }
        if(a <= l && r <= b && max_val[k] == min_val[k]) {
            lazy[k] = max_val[k] % x;
            lazyFlag[k] = true;
            eval(k, l, r);
        }else{
            modulo_update(a, b, x, 2*k+1, l, (l+r)/2);
            modulo_update(a, b, x, 2*k+2, (l+r)/2, r);
            opr(k);
        }
    }
    void add(int a, int b, T x, int k=0, int l=0, int r=-1){
        if(r < 0) r = n;
        eval(k, l, r);
        if(b <= l || r <= a) return;
        if(a <= l && r <= b){
            lazy_add[k] += x; eval(k, l, r);
        }else{
            add(a, b, x, 2*k+1, l, (l+r)/2); add(a, b, x, 2*k+2, (l+r)/2, r);
            //node[k] = node[2*k+1] + node[2*k+2];
            opr(k);
        }
    }
    T query(int a, int b, int k=0, int l=0, int r=-1) {
        if(r < 0) r = n;
        eval(k, l, r);
        if(b <= l || r <= a) return 0;
        if(a <= l && r <= b) return node[k];
        return query(a, b, 2*k+1, l, (l+r)/2) + query(a, b, 2*k+2, (l+r)/2, r);
    }
    void print(){for(int i = 0; i < sz; i++)cout<<query(i,i+1)<< " ";cout<<endl;}
};

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n,q;
    cin >> n >> q;
    vector<int>a(n);
    rep(i,n)cin >> a[i];
    segtree<int>sg(a);
    rep(i,q){
        int a,l,r;
        cin >> a >> l >> r;
        l--;
        if(a==1){
            sg.modulo_update(l,r,2);
        }else if(a==2){
            int x;
            cin >> x;
            sg.add(l,r,x);
        }else{
            cout << sg.query(l,r) << "\n";
        }
        //sg.print();
    }
    return 0;
}