#include using namespace std; using ll = long long; template struct lazy_segtree { public: lazy_segtree() : lazy_segtree(0) {} lazy_segtree(int n) : lazy_segtree(std::vector(n, e())) {} lazy_segtree(const std::vector& v) : _n(int(v.size())) { log = ceil_pow2(_n); size = 1 << log; d = std::vector(2 * size, e()); lz = std::vector(size, id()); for (int i = 0; i < _n; i++) d[size + i] = v[i]; for (int i = size - 1; i >= 1; i--) { update(i); } } void set(int p, S x) { assert(0 <= p && p < _n); p += size; for (int i = log; i >= 1; i--) push(p >> i); d[p] = x; for (int i = 1; i <= log; i++) update(p >> i); } S get(int p) { assert(0 <= p && p < _n); p += size; for (int i = log; i >= 1; i--) push(p >> i); return d[p]; } S prod(int l, int r) { assert(0 <= l && l <= r && r <= _n); if (l == r) return e(); l += size; r += size; for (int i = log; i >= 1; i--) { if (((l >> i) << i) != l) push(l >> i); if (((r >> i) << i) != r) push(r >> i); } S sml = e(), smr = e(); while (l < r) { if (l & 1) sml = op(sml, d[l++]); if (r & 1) smr = op(d[--r], smr); l >>= 1; r >>= 1; } return op(sml, smr); } S all_prod() { return d[1]; } void apply(int p, F f) { assert(0 <= p && p < _n); p += size; for (int i = log; i >= 1; i--) push(p >> i); d[p] = mapping(f, d[p]); for (int i = 1; i <= log; i++) update(p >> i); } void apply(int l, int r, F f) { assert(0 <= l && l <= r && r <= _n); if (l == r) return; l += size; r += size; for (int i = log; i >= 1; i--) { if (((l >> i) << i) != l) push(l >> i); if (((r >> i) << i) != r) push((r - 1) >> i); } { int l2 = l, r2 = r; while (l < r) { if (l & 1) all_apply(l++, f); if (r & 1) all_apply(--r, f); l >>= 1; r >>= 1; } l = l2; r = r2; } for (int i = 1; i <= log; i++) { if (((l >> i) << i) != l) update(l >> i); if (((r >> i) << i) != r) update((r - 1) >> i); } } template int max_right(int l) { return max_right(l, [](S x) { return g(x); }); } template int max_right(int l, G g) { assert(0 <= l && l <= _n); assert(g(e())); if (l == _n) return _n; l += size; for (int i = log; i >= 1; i--) push(l >> i); S sm = e(); do { while (l % 2 == 0) l >>= 1; if (!g(op(sm, d[l]))) { while (l < size) { push(l); l = (2 * l); if (g(op(sm, d[l]))) { sm = op(sm, d[l]); l++; } } return l - size; } sm = op(sm, d[l]); l++; } while ((l & -l) != l); return _n; } template int min_left(int r) { return min_left(r, [](S x) { return g(x); }); } template int min_left(int r, G g) { assert(0 <= r && r <= _n); assert(g(e())); if (r == 0) return 0; r += size; for (int i = log; i >= 1; i--) push((r - 1) >> i); S sm = e(); do { r--; while (r > 1 && (r % 2)) r >>= 1; if (!g(op(d[r], sm))) { while (r < size) { push(r); r = (2 * r + 1); if (g(op(d[r], sm))) { sm = op(d[r], sm); r--; } } return r + 1 - size; } sm = op(d[r], sm); } while ((r & -r) != r); return 0; } private: int _n, size, log; std::vector d; std::vector lz; void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); } void all_apply(int k, F f) { d[k] = mapping(f, d[k]); if (k < size) { lz[k] = composition(f, lz[k]); if (lz[k] == id()) return; if (d[k][4] == 0) push(k), update(k); } } void push(int k) { all_apply(2 * k, lz[k]); all_apply(2 * k + 1, lz[k]); lz[k] = id(); } int ceil_pow2(int n) { int x = 0; while ((1U << x) < (unsigned int)(n)) x++; return x; } }; //value, sumv, maxv, size, flag using S = array; //0:のときgcd //1:のとき代入 using F = pair; //単位元 S e(){return S({0, 0, 0, 0, 1});} //演算 S op(S l, S r){ l[1] += r[1]; l[2] = max(l[2], r[2]); l[3] += r[3]; l[4] &= r[4] & (l[0] == r[0]); return l; } //xにfを作用させた時の値の変化 S mapping(F f, S x){ if(f.first == 1){ x[0] = f.second; x[1] = x[0] * x[3]; x[2] = x[0]; x[4] = 1; return x; } if(x[4] == 0) return x; x[0] = __gcd(x[0], f.second); x[1] = x[0] * x[3]; x[2] = x[0]; return x; } //gを演算した後にfを演算させると演算子はどうなるか F composition(F f, F g){ if(f.first == 1) return f; if(g.first == 1) return make_pair(1, __gcd(g.second, f.second)); return make_pair(0, __gcd(g.second, f.second)); } //作用させても変化させないもの F id(){return make_pair(0, 0);} int main(){ ios::sync_with_stdio(false); cin.tie(0); int N, Q, cmd, l, r, x; cin >> N >> Q; vector tmp(N); for(int i = 0; i < N; i++){ cin >> x; tmp[i][0] = tmp[i][1] = tmp[i][2] = x; tmp[i][3] = tmp[i][4] = 1; } lazy_segtree seg(tmp); while(Q--){ cin >> cmd >> l >> r; l--; if(cmd <= 2){ cin >> x; seg.apply(l, r, make_pair(2 - cmd, x)); }else{ auto p = seg.prod(l, r); cout << p[5 - cmd] << '\n'; } } }