import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


long gcd(long a, long b) {
  // if (a < 0) a = -a;
  // if (b < 0) b = -b;
  if (a == 0) return b;
  if (b == 0) return a;
  const int s = bsf(a | b);
  a >>= bsf(a);
  do {
    b >>= bsf(b);
    if (a > b) swap(a, b);
    b -= a;
  } while (b);
  return a << s;
}


enum INF = 10L^^9 + 10;

struct T {
  bool same;
  long mx, sum;
  T opBinary(string op)(ref const(T) t) const {
    return T(same && t.same && mx == t.mx,
             max(mx, t.mx),
             sum + t.sum);
  }
};
enum idT = T(true, 0, 0);

T sameOf(long val, int sz) {
  return T(true, val, val * sz);
}

class SegmentTree {
  int n;
  T[] ts;
  long[] ss;
  this(int n_, T[] ini) {
    for (n = 1; n < n_; n <<= 1) {}
    ts = new T[n << 1];
    ts[0 .. n] = idT;
    ts[n .. n + n_] = ini[];
    ts[n + n_ .. n << 1] = idT;
    foreach_reverse (a; 1 .. n) ts[a] = ts[a << 1] * ts[a << 1 | 1];
    ss = new long[n << 1];
    ss[] = -1;
  }

  // x -> val
  private void query1(int u, int l, int r, int a, int b, long val) {
    chmax(a, l);
    chmin(b, r);
    if (a >= b) return;
    if (a == l && b == r) {
      ts[u] = sameOf(val, r - l);
      ss[u] = val;
      return;
    }
    const uL = u << 1, uR = u << 1 | 1, mid = (l + r) >> 1;
    if (ss[u] != -1) {
      ts[uL] = sameOf(ss[u], mid - l);
      ts[uR] = sameOf(ss[u], r - mid);
      ss[uL] = ss[u];
      ss[uR] = ss[u];
      ss[u] = -1;
    }
    query1(uL, l, mid, a, b, val);
    query1(uR, mid, r, a, b, val);
    ts[u] = ts[uL] * ts[uR];
  }
  void query1(int a, int b, long val) {
    query1(1, 0, n, a, b, val);
  }

  // x -> gcd(x, val)
  private void query2(int u, int l, int r, int a, int b, long val) {
    chmax(a, l);
    chmin(b, r);
    if (a >= b) return;
    if (a == l && b == r && ts[u].same) {
      const g = gcd(ts[u].mx, val);
      ts[u] = sameOf(g, r - l);
      ss[u] = g;
      return;
    }
    const uL = u << 1, uR = u << 1 | 1, mid = (l + r) >> 1;
    if (ss[u] != -1) {
      ts[uL] = sameOf(ss[u], mid - l);
      ts[uR] = sameOf(ss[u], r - mid);
      ss[uL] = ss[u];
      ss[uR] = ss[u];
      ss[u] = -1;
    }
    query2(uL, l, mid, a, b, val);
    query2(uR, mid, r, a, b, val);
    ts[u] = ts[uL] * ts[uR];
  }
  void query2(int a, int b, long val) {
    query2(1, 0, n, a, b, val);
  }

  private T query(int u, int l, int r, int a, int b) {
    chmax(a, l);
    chmin(b, r);
    if (a >= b) return idT;
    if (a == l && b == r) return ts[u];
    const uL = u << 1, uR = u << 1 | 1, mid = (l + r) >> 1;
    if (ss[u] != -1) {
      ts[uL] = sameOf(ss[u], mid - l);
      ts[uR] = sameOf(ss[u], r - mid);
      ss[uL] = ss[u];
      ss[uR] = ss[u];
      ss[u] = -1;
    }
    const resL = query(uL, l, mid, a, b);
    const resR = query(uR, mid, r, a, b);
    ts[u] = ts[uL] * ts[uR];
    return resL * resR;
  }
  T query(int a, int b) {
    return query(1, 0, n, a, b);
  }
}


int N, Q;
long[] A;
int[] TYP, L, R;
long[] X;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      Q = readInt();
      A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      TYP = new int[Q];
      L = new int[Q];
      R = new int[Q];
      X = new long[Q];
      foreach (q; 0 .. Q) {
        TYP[q] = readInt();
        L[q] = readInt() - 1;
        R[q] = readInt();
        if (TYP[q] == 1 || TYP[q] == 2) {
          X[q] = readLong();
        }
      }
      
      auto ini = new T[N];
      foreach (i; 0 .. N) {
        ini[i] = sameOf(A[i], 1);
      }
      auto seg = new SegmentTree(N, ini);
      foreach (q; 0 .. Q) {
        switch (TYP[q]) {
          case 1: {
            seg.query1(L[q], R[q], X[q]);
          } break;
          case 2: {
            seg.query2(L[q], R[q], X[q]);
          } break;
          case 3: {
            const res = seg.query(L[q], R[q]);
            writeln(res.mx);
          } break;
          case 4: {
            const res = seg.query(L[q], R[q]);
            writeln(res.sum);
          } break;
          default: assert(false);
        }
        debug {
          for (int a = 1; a <= seg.n; a <<= 1) {
            writeln(seg.ts[a .. a << 1]);
          }
          writeln("ss = ", seg.ss);
        }
      }
    }
  } catch (EOFException e) {
  }
}