consultas

#include<bits/stdc++.h>

using namespace std;

long long int v[1000010], sv[1000010];

int main(){
    int n, q; scanf("%d %d", &n, &q);

    for(int i = 0; i < n; i++){
        scanf("%lld", &v[i]);
        v[n+i] = v[i];
    }

    sv[0] = v[0];
    for(int i = 1; i < 2*n; i++){
        sv[i] = sv[i-1]+v[i];
    }

    int pos = 0;
    while(q--){
        int o; scanf("%d", &o);
        if(o == 1){
            int c; scanf("%d", &c);
            pos = (pos+c)%n;
        }
        else{
            int l, r; scanf("%d %d", &l, &r);
            printf("%lld\n", sv[pos+r-1]-sv[pos+l-1-1]);
        }
    }

}