import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.math.BigDecimal; import java.math.RoundingMode; import java.util.*; public class Main { static final long MOD=1000000007; static final long MOD1=998244353; static int ans=0; public static void main(String[] args){ PrintWriter out = new PrintWriter(System.out); InputReader sc=new InputReader(System.in); int N = sc.nextInt(); int Q = sc.nextInt(); long[] A = new long[N+1]; for (int i = 1; i < A.length; i++) { A[i] = A[i-1] + sc.nextLong(); } BIT bit = new BIT(N+1); TreeSet treeSet = new TreeSet<>(); for (int i = 1; i < A.length; i++) { bit.add(i, 1); treeSet.add(i); } for (int i = 0; i < Q; i++) { int T = sc.nextInt(); int l = sc.nextInt(); int r = sc.nextInt(); if (T==1) { int l1 = get(l, bit, N); int r1 = get(r, bit, N); for (int j = l; j < r; j++) { int x = treeSet.ceiling(l1); if(x>=r1)throw new ArrayIndexOutOfBoundsException(); treeSet.remove(x); bit.add(x, -1); } }else { int l1 = 0; if (l>1) { l1 = get(l-1, bit, N); } int r1 = get(r, bit, N); out.println(A[r1]-A[l1]); } } out.flush(); } static int get(int l,BIT bit,int N){ int from=0; int to=N; while ((to-from)>=1) { int mid=(to-from)/2+from; if (bit.sum(mid)>=l){ to=mid; } else { from=mid+1; } } return to; } static class BIT{ int size; int[] bit; public BIT(int n) { size=n; bit=new int[size]; } public int sum(int i){ int s=0; while (i>0) { s+=bit[i]; i-=(i&(-i));//iの二進表現での一番右の1を消す } return s; } public void add(int i,int x) { while (i= lenbuf) { curbuf = 0; try { lenbuf = in.read(buffer); } catch (IOException e) { throw new InputMismatchException(); } if (lenbuf <= 0) return false; } return true; } private int readByte() { if (hasNextByte()) return buffer[curbuf++]; else return -1; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private void skip() { while (hasNextByte() && isSpaceChar(buffer[curbuf])) curbuf++; } public boolean hasNext() { skip(); return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (!isSpaceChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public int nextInt() { if (!hasNext()) throw new NoSuchElementException(); int c = readByte(); while (isSpaceChar(c)) c = readByte(); boolean minus = false; if (c == '-') { minus = true; c = readByte(); } int res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res = res * 10 + c - '0'; c = readByte(); } while (!isSpaceChar(c)); return (minus) ? -res : res; } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); int c = readByte(); while (isSpaceChar(c)) c = readByte(); boolean minus = false; if (c == '-') { minus = true; c = readByte(); } long res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res = res * 10 + c - '0'; c = readByte(); } while (!isSpaceChar(c)); return (minus) ? -res : res; } public double nextDouble() { return Double.parseDouble(next()); } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public double[] nextDoubleArray(int n) { double[] a = new double[n]; for (int i = 0; i < n; i++) a[i] = nextDouble(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } public char[][] nextCharMap(int n, int m) { char[][] map = new char[n][m]; for (int i = 0; i < n; i++) map[i] = next().toCharArray(); return map; } } }