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

int i1, i2, tip, n, m, x, c, S[100002][65];
vector<pair <int, int> > v;
inline int CBIN1(int i3){
    int st = 0, dr = m - 1, Sol = -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(st > Sol)
                Sol = st;
        }
        if(v[mid].f == i3){
            Sol = mid;
            dr = mid - 1;
        }
    }
    return Sol;
}
inline int CBIN2(int i3){
    int st = 0, dr = m - 1, Sol = -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(st > Sol)
                Sol = st;
        }
        if(v[mid].f == i3){
            Sol = mid;
            st = mid + 1;
        }
    }
    return Sol;
}
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 <= 64 ; ++i){
        S[0][i] = (i == v[0].s);
        for(int j = 1 ; j < v.size() ; ++j)
            S[j][i] = S[j - 1][i] + (i == v[j].s);
    }
    for(int i = 1; i <= m ; ++i){
        scanf("%d%d%d", &tip, &i1, &i2);
        if(tip == 0){
            int P = CBIN1(i1);
            v[P].f = v[P].f + i2;
            continue ;
        }
        int P1 = CBIN1(i1), P2 = CBIN2(i2);
        int Sol = 0;
        for(int i = 1; i <= 64 ; ++i)
            Sol = max(S[P2][i] - S[P1 - 1][i], Sol);
        printf("%d\n", Sol);
    }
    return 0;
}