import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, 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)); }


void bAdd(T)(T[] bit, int pos, T val)
in {
  assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold");
}
do {
  for (int x = pos; x < bit.length; x |= x + 1) {
    bit[x] += val;
  }
}

// sum of [0, pos)
T bSum(T)(T[] bit, int pos)
in {
  assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold");
}
do {
  T ret = 0;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    ret += bit[x];
  }
  return ret;
}

// min pos s.t. pred(sum of [0, pos))
//   assume pred(sum of [0, pos)) is non-decreasing
int bBinarySearch(alias pred, T)(T[] bit) {
  import core.bitop : bsr;
  import std.functional : unaryFun;
  alias predFun = unaryFun!pred;
  if (predFun(0)) return 0;
  int pos = 0;
  T sum = 0;
  foreach_reverse (e; 0 .. bsr(bit.length) + 1) {
    const x = (pos | 1 << e) - 1;
    if (x < bit.length && !predFun(sum + bit[x])) {
      pos |= 1 << e;
      sum += bit[x];
    }
  }
  return pos + 1;
}


void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const Q = readInt();
      auto A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      auto T = new int[Q];
      auto L = new int[Q];
      auto R = new int[Q];
      foreach (q; 0 .. Q) {
        T[q] = readInt();
        L[q] = readInt() - 1;
        R[q] = readInt();
      }
      
      auto ASum = new long[N + 1];
      foreach (i; 0 .. N) {
        ASum[i + 1] = ASum[i] + A[i];
      }
      
      auto nxt = new int[N + 1];
      foreach (i; 0 .. N) {
        nxt[i] = i + 1;
      }
      nxt[N] = N;
      
      auto bit = new int[N + 1];
      foreach (i; 0 .. N + 1) {
        bit.bAdd(i, 1);
      }
      foreach (q; 0 .. Q) {
        const l = bit.bBinarySearch!(sum => (sum >= L[q] + 1)) - 1;
        const r = bit.bBinarySearch!(sum => (sum >= R[q] + 1)) - 1;
        const val = ASum[r] - ASum[l];
        debug {
          // writeln(l, " ", r, " ", val);
        }
        if (T[q] == 1) {
          for (int i = l; i < r; i = nxt[i]) {
            if (l != i) {
              bit.bAdd(i, -1);
            }
          }
          nxt[l] = r;
        } else {
          writeln(val);
        }
      }
    }
  } catch (EOFException e) {
  }
}