#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <unordered_map>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>
#include <cassert>
#include <stdlib.h>
#include <time.h>
#include <random>


//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,sse3,sse4")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC target("avx2")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")

//#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

//const int INF = 1e17;
//const int mod = 2600000069;
//const int p = 179;
const int MAXN = 1e5 + 1;
int sq;

int n, m;
int a[MAXN], cnt[MAXN], lst[MAXN];

void update(int v, int k) {
    v--;
    a[v] = k;
    while (v % sq != 0) {
        if (a[v] + v < (v + 1) * sq) {
            cnt[v] = cnt[v + a[v]] + 1;
            lst[v] = lst[v + a[v]];
            if (lst[v + a[v]] == v + a[v]) cnt[v]--;
        } else {
            cnt[v] = 1;
            lst[v] = v;
        }
        v--;
    }
    if (a[v] + v < (v + 1) * sq) {
        cnt[v] = cnt[v + a[v]] + 1;
        lst[v] = lst[v + a[v]];
    } else {
        cnt[v] = 1;
        lst[v] = v;
    }
}

void ask(int v) {
    v--;
    int ans = 0;
    while (v < n) {
        ans += cnt[v];
        if (v == lst[v] && v + a[v] < n) v += a[v];
        else if (v != lst[v]) v = lst[v];
        else break;
    }
    cout << v + 1 << " " << ans << "\n";
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    sq = sqrt(n) + 1;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        lst[i] = i;
    }
    for (int i = n - 1; i >= 0; i--) {
        if (a[i] + i < min((i/sq + 1) * sq, n)) {
            cnt[i] = cnt[i + a[i]] + 1;
            lst[i] = lst[i + a[i]];
            if (lst[i + a[i]] == i + a[i]) cnt[i]--;
        } else {
            cnt[i] = 1;
            lst[i] = i;
        }
    }
//    for (auto k : lst) cout << k << " ";
//    cout << "\n";
//    for (auto k : cnt) cout << k << " ";
//    cout << "\n";
    int t, ind, val;
    for (int i = 0; i < m; i++) {
        cin >> t;
        if (t == 0) {
            cin >> ind >> val;
            update(ind, val);
        } else {
            cin >> ind;
            ask(ind);
        }
    }
}
/*

*/