#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")

// Begin Header {{{
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)

constexpr size_t    operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t  operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };

constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;

template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;

inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
    cin >> head;
    input(forward<Tail>(tail)...);
}

template <class T>
inline istream& operator>>(istream &is, vector<T> &vec) {
    for (auto &e: vec) {
        is >> e;
    }
    return is;
}

inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
    cout << head;
    if (sizeof...(tail)) {
        cout << " ";
    }
    output(forward<Tail>(tail)...);
}

template <class T>
inline ostream& operator<<(ostream &os, const vector<T> &vec) {
    static constexpr const char *delim[] = {" ", ""};
    for (const auto &e: vec) {
        os << e << delim[&e == &vec.back()];
    }
    return os;
}

template <class T>
inline vector<T> makeVector(const T &initValue, size_t sz) {
    return vector<T>(sz, initValue);
}

template <class T, class... Args>
inline auto makeVector(const T &initValue, size_t sz, Args... args) {
    return vector<decltype(makeVector<T>(initValue, args...))>(sz, makeVector<T>(initValue, args...));
}

template <class Func>
class FixPoint : Func {
public:
    explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}

    template <class... Args>
    constexpr decltype(auto) operator()(Args&&... args) const {
        return Func::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
    return FixPoint<Func>{forward<Func>(f)};
}

template <class Container>
struct reverse_t {
    Container &c;
    reverse_t(Container &c) : c(c) {}
    auto begin() { return c.rbegin(); }
    auto end() { return c.rend(); }
};

template <class Container>
auto reversed(Container &c) {
    return reverse_t<Container>(c);
}

template <class T>
inline bool chmax(T &a, const T &b) noexcept {
    return b > a && (a = b, true);
}

template <class T>
inline bool chmin(T &a, const T &b) noexcept {
    return b < a && (a = b, true);
}

template <class T>
inline T diff(const T &a, const T &b) noexcept {
    return a < b ? b - a : a - b;
}
// End Header }}}

// SegmentTree {{{
template <typename Monoid>
struct SegmentTree {
    using Func = function<Monoid(Monoid, Monoid)>;
    const size_t sz;
    const Func fn;
    const Monoid unity;
    vector<Monoid> seg;

    SegmentTree(const size_t n, const Monoid &u, Func f)
        : sz(1 << (__lg(n + 5) + 1)), fn(f), unity(u), seg(sz * 2, unity) {}

    void set(size_t k, const Monoid &v) {
        seg[k + sz] = v;
    }

    Monoid& operator[](size_t k) {
        return seg[k + sz];
    }

    const Monoid& operator[](size_t k) const {
        return seg[k + sz];
    }

    void build() {
        for (size_t k = sz - 1; k > 0; --k) {
            seg[k] = fn(seg[2 * k], seg[2 * k + 1]);
        }
    }

    void update(size_t k, const Monoid &x) {
        k += sz;
        seg[k] = x;
        while (k >>= 1) {
            seg[k] = fn(seg[2 * k], seg[2 * k + 1]);
        }
    }

    Monoid query(size_t l, size_t r) const {
        Monoid L = unity;
        Monoid R = unity;
        for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) {
            if (l & 1) {
                L = fn(L, seg[l++]);
            }
            if (r & 1) {
                R = fn(seg[--r], R);
            }
        }
        return fn(L, R);
    }
};
// }}}

struct Data {
    intmax_t score;
    size_t idx;

    Data() {}
    Data(intmax_t score, size_t idx) : score(score), idx(idx) {}

    bool operator>(const Data& rhs) const {
        if (score == rhs.score) {
            return idx < rhs.idx;
        } else {
            return score > rhs.score;
        }
    }
    bool operator<(const Data& rhs) const {
        if (score == rhs.score) {
            return idx > rhs.idx;
        } else {
            return score < rhs.score;
        }
    }
    friend ostream& operator<<(ostream& os, const Data& rhs) {
        os << '(' << rhs.score << ", " << rhs.idx << ')';
        return os;
    }
};

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.setf(ios_base::fixed);
    cout.precision(10);

    var(size_t, N, C);

    vector<Data> stat;
    rep(i, 0, N) stat.emplace_back(0, i);
    vector<intmax_t> cur_score(N);
    vector<size_t> com(C), t(C), m(C);
    vector<intmax_t> p(C);
    rep(i, 0, C) {
        input(com[i]);
        if (com[i] == 0) {
            input(t[i], p[i]);
            t[i]--;
            cur_score[t[i]] += p[i];
            stat.emplace_back(cur_score[t[i]], t[i]);
        } else {
            input(m[i]);
        }
    }

    const size_t M = stat.size();
    sort(stat.begin(), stat.end(), greater<>());
    map<Data, size_t> pos;
    map<size_t, Data> dic;
    rep(i, 0, M) {
        pos[stat[i]] = i;
        dic[i] = stat[i];
    }

    cur_score.assign(N, 0);
    SegmentTree<intmax_t> sg(M, 0, [](auto a, auto b) { return a + b; });
    rep(i, 0, N) sg.set(pos[Data(0, i)], 1);
    sg.build();
    rep(i, 0, C) {
        if (com[i] == 0) {
            const size_t cur_pos = pos[Data(cur_score[t[i]], t[i])];
            sg.update(cur_pos, sg[cur_pos] - 1);
            cur_score[t[i]] += p[i];
            const size_t nxt_pos = pos[Data(cur_score[t[i]], t[i])];
            sg.update(nxt_pos, sg[nxt_pos] + 1);
        } else {
            int ng = -1, ok = M - 1;
            while (ok - ng > 1) {
                const int mid = (ok + ng) / 2;
                if (sg.query(0, mid + 1) >= m[i]) ok = mid;
                else ng = mid;
            }
            output(dic[ok].idx + 1, dic[ok].score);
        }
    }

    return 0;
}



Measured memory_bytes: 38924