#include <bits/stdc++.h>

using namespace std;

constexpr int maxn = 2e5 + 5, lg = 18;

int ans[maxn][lg];

void solve() {
    int n, q;
    cin >> n >> q;
    vector<int> p(n);
    for (int i = 0; i < n; ++i) {
        cin >> p[i];
    }
    for (int i = n - 1; i >= 0; --i) {
        ans[i][0] = p[i];
        for (int j = 1; j < lg && i + (1 << (j - 1)) < n; ++j) {
            ans[i][j] = abs(ans[i][j - 1] - ans[i + (1 << (j - 1))][j - 1]);
        }
    }
    while (q--) {
        int tp;
        cin >> tp;
        if (tp == 1) {
            int ind, val;
            cin >> ind >> val;
            ind--;
            p[ind] = val;
            for (int i = ind; i >= 0; --i) {
                ans[i][0] = p[i];
                for (int j = 1; j < lg && i + (1 << (j - 1)) < n; ++j) {
                    ans[i][j] = abs(ans[i][j - 1] - ans[i + (1 << (j - 1))][j - 1]);
                }
            }
        } else {
            int l, k;
            cin >> l >> k;
            l--;
            cout << ans[l][k] << '\n';
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}