#include <cstdio>
#include <vector>
#include <algorithm>
#define f first
#define s second
using namespace std;

int tip, n, m, x, c;
int i1, i2;
int f[65];
vector<pair <int, int> > v;
inline int CBIN(int i3){
    int st = 0, dr = m - 1;
    while(st <= dr){
        int mid = (st + dr) / 2;
        if(v[mid].f > i3)
            dr = mid - 1;
        if(v[mid].f < i3)
            st = mid + 1;
        if(v[mid].f == i3)
            return mid;
    }
    if(v[dr].f <= i3 && v[dr].f > v[st].f)
        return dr;
    return st;
}
int main()
{
    freopen("marbles.in", "r", stdin);
    freopen("marbles.out", "w", stdout);
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n ; ++i){
        scanf("%d%d", &x, &c);
        v.push_back(make_pair(x, c));
    }
    sort(v.begin(), v.end());
    for(int i = 1; i <= m ; ++i){
        scanf("%d%d%d", &tip, &i1, &i2);
        if(tip == 0){
            int P = CBIN(i1);
            v[P].f = v[P].f + i2;
            continue ;
        }
        int P1 = CBIN(i1), P2 = CBIN(i2);
        int Sol = 0;
        for(int j = P1; j <= P2 ; ++j){
            ++f[v[j].s];
            if(Sol < f[v[j].s])
                Sol = f[v[j].s];
        }
        printf("%d\n", Sol);
        for(int j = P1; j <= P2 ; ++j)
            f[v[j].s] = 0;
    }
    return 0;
}