#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
template<class V> struct BIT {
    BIT() {}  // [L, R)
    int NV;vector<V> bit;
    BIT(int n){init(n);}
    void init(int n){NV=1;while(NV<n)NV*=2;bit.resize(NV);}
    V operator[](int e) { V s = 0; e++; while (e) s += bit[e - 1], e -= e&-e; return s; }
    void add(int e, V v) { e++; while (e <= NV) bit[e - 1] += v, e += e&-e; }
    int lower_bound(V val) { 
        V tv = 0; int i, ent = 0; for (i = NV - 1; i >= 0; i--)
        if(tv+bit[ent+(1<<i)-1]<=val)tv+=bit[ent+(1<<i)-1],ent += (1 << i);return ent;
    }
    V get(int L, int R) {
        assert(0 <= L); assert(R <= NV); assert(L <= R);
        V res = 0; if(R) res += operator[](R - 1); if (L) res -= operator[](L - 1);return res;
    }
    void clear() { bit.clear(); }
};
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧  
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
　　　　 （ ´_ゝ`）　/　 ⌒i     
　　　　／　　　＼　 　 |　|     
　　　 /　　 /￣￣￣￣/　　|  
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿  
　 　　　＼/＿＿＿＿/　（u　⊃  
---------------------------------------------------------------------------------------------------*/




int N, C;
int type[101010], a0[101010], a1[101010];
ll point[101010];
vector<ll> z; int nz;
vector<int> idx[101010];
BIT<int> bit;
BIT<int> bits[101010];
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N >> C;
    z.push_back(0);
    rep(c, 0, C) {
        cin >> type[c];
        if (type[c] == 0) {
            cin >> a0[c] >> a1[c];
            a0[c]--;
            point[a0[c]] += a1[c];
            z.push_back(point[a0[c]]);
        }
        else cin >> a0[c];
    }

    // for zaatsu
    sort(all(z));
    z.erase(unique(all(z)), z.end());
    nz = z.size();
    bit.init(nz);

    // make idx and bits
    rep(i, 0, N) point[i] = 0;
    rep(c, 0, C) {
        if (type[c] == 0) {
            point[a0[c]] += a1[c];
            int i = lower_bound(all(z), point[a0[c]]) - z.begin();
            idx[i].push_back(a0[c]);
        }
    }
    rep(i, 0, N) idx[0].push_back(i);
    rep(i, 0, nz) {
        sort(all(idx[i]));
        bits[i].init(idx[i].size());
    }

    // do
    rep(i, 0, N) point[i] = 0;
    bit.add(0, N);
    rep(i, 0, N) bits[0].add(i, 1);
    rep(c, 0, C) {
        if (type[c] == 0) {
            int id, id2;

            id = lower_bound(all(z), point[a0[c]]) - z.begin();
            bit.add(id, -1);
            id2 = lower_bound(all(idx[id]), a0[c]) - idx[id].begin();
            bits[id].add(id2, -1);
            
            point[a0[c]] += a1[c];
            
            id = lower_bound(all(z), point[a0[c]]) - z.begin();
            bit.add(id, 1);
            id2 = lower_bound(all(idx[id]), a0[c]) - idx[id].begin();
            bits[id].add(id2, 1);
        } else {
            int ok = 0, ng = nz;
            while (ok + 1 != ng) {
                int md = (ng + ok) / 2;
                if (a0[c] <= bit.get(md, nz)) ok = md;
                else ng = md;
            }
            
            int id = ok;
            a0[c] -= bit.get(ok + 1, nz);

            ng = 0, ok = idx[id].size();
            while (ng + 1 != ok) {
                int md = (ng + ok) / 2;
                if (a0[c] <= bits[id].get(0, md)) ok = md;
                else ng = md;
            }


            int id2 = ok - 1;

            printf("%d %lld\n", idx[id][id2] + 1, z[id]);
        }
    }
    
}


Measured memory_bytes: 18736