/* -*- coding: utf-8 -*-
 *
 * 3507.cc:  No.3507 RangeSum RangeUpdate RangeSqrt - yukicoder
 */

#include<cstdio>
#include<cmath>
#include<vector>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 100000;
const int M = 6;

/* typedef */

using ll = long long;

struct Elm {
  ll vs[M];
  int w;
  Elm(): vs(), w() {}
  Elm(int x, int _w) { set(x, _w); }

  void set(int x, int _w) {
    w = _w;
    vs[0] = (ll)x * w;
    for (int i = 1; i < M; i++) {
      x = sqrt(0.5 + x);
      vs[i] = (ll)x * w;
    }
  }

  Elm operator+(const Elm &e) {
    Elm r;
    r.w = w + e.w;
    for (int i = 0; i < M; i++) r.vs[i] = vs[i] + e.vs[i];
    return r;
  }

  Elm &shift() {
    for (int i = 1; i < M; i++) vs[i - 1] = vs[i];
    return *this;
  }

  ll val() const { return vs[0]; }
};

struct SegTreeSumDelay {
  using T = Elm;
  int e2;
  vector<T> nodes;
  T defv;
  vector<int> dls;
  SegTreeSumDelay() {}

  void init(int n, T _defv) {
    defv = _defv;
    for (e2 = 1; e2 < n; e2 <<= 1);
    nodes.assign(e2 * 2, defv);
    dls.assign(e2 * 2, -1);
  }

  T &geti(int i) { return nodes[e2 - 1 + i]; }
  void seti(int i, T v) { geti(i) = v; }

  void setall() {
    for (int j = e2 - 2; j >= 0; j--)
      nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];
  }

  void __update(int k, int w) {
    if (dls[k] != -1 && w > 1) {
      int k0 = k * 2 + 1, k1 = k0 + 1, hw = w / 2;
      if (dls[k] >= 0) { // set
	nodes[k0].set(dls[k], hw);
	nodes[k1].set(dls[k], hw);
	dls[k0] = dls[k1] = dls[k];
      }
      else { // shift
	if (dls[k0] >= 0) __update(k0, hw);
	if (dls[k1] >= 0) __update(k1, hw);
	nodes[k0].shift();
	nodes[k1].shift();
	dls[k0] = dls[k1] = -2;
      }
    }
    dls[k] = -1;
  }

  void set_range(int r0, int r1, int v, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return;
    if (r0 <= i0 && i1 <= r1) {
      nodes[k].set(v, i1 - i0);
      dls[k] = v;
      return;
    }

    __update(k, i1 - i0);

    int im = (i0 + i1) / 2;
    int k0 = k * 2 + 1, k1 = k0 + 1;
    set_range(r0, r1, v, k0, i0, im);
    set_range(r0, r1, v, k1, im, i1);
    nodes[k] = nodes[k0] + nodes[k1];
  }
  void set_range(int r0, int r1, int v) { set_range(r0, r1, v, 0, 0, e2); }

  void shift_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return;
    if (r0 <= i0 && i1 <= r1) {
      if (dls[k] >= 0) __update(k, i1 - i0);
      nodes[k].shift();
      dls[k] = -2;
      return;
    }

    __update(k, i1 - i0);

    int im = (i0 + i1) / 2;
    int k0 = k * 2 + 1, k1 = k0 + 1;
    shift_range(r0, r1, k0, i0, im);
    shift_range(r0, r1, k1, im, i1);
    nodes[k] = nodes[k0] + nodes[k1];
  }
  void shift_range(int r0, int r1) { shift_range(r0, r1, 0, 0, e2); }

  T sum_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return defv;
    if (r0 <= i0 && i1 <= r1) return nodes[k];

    __update(k, i1 - i0);

    int im = (i0 + i1) / 2;
    T v0 = sum_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = sum_range(r0, r1, k * 2 + 2, im, i1);
    return v0 + v1;
  }
  T sum_range(int r0, int r1) { return sum_range(r0, r1, 0, 0, e2); }
};

/* global variables */

int as[MAX_N];
SegTreeSumDelay st;

/* subroutines */

/* main */

int main() {
  int n, qn;
  scanf("%d%d", &n, &qn);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  st.init(n, Elm());
  for (int i = 0; i < n; i++) st.seti(i, Elm(as[i], 1));
  st.setall();


  while (qn--) {
    int op, l, r;
    scanf("%d%d%d", &op, &l, &r);

    if (op == 0) { // print
      //printf(" %d %d %d\n", op, l, r);

      auto e = st.sum_range(l, r);
      printf("%lld\n", e.val());
    }
    else if (op == 1) { // set
      int x;
      scanf("%d", &x);
      //printf(" %d %d %d %d\n", op, l, r, x);
      
      st.set_range(l, r, x);
    }
    else { // op == 2: shift
      //printf(" %d %d %d\n", op, l, r);

      st.shift_range(l, r);
    }
  }

  return 0;
}