#include <bits/extc++.h>

using namespace std;

void solve() {
    int n, q;
    cin >> n >> q;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector<long long> pr_sum(n + 1);
    for (int i = 0; i < n; ++i) {
        pr_sum[i + 1] = pr_sum[i] + a[i];
    }
    while (q--) {
        int tp;
        cin >> tp;
        if (tp == 1) {
            int l, r;
            cin >> l >> r;
            l--;
            long long ans = abs(pr_sum[r] - pr_sum[l]);
            for (int len = 1; len < r - l; ++len) {
                ans = max(ans, min(abs(pr_sum[l + len] - pr_sum[l]), abs(pr_sum[r] - pr_sum[l + len])));
            }
            cout << ans << '\n';
        } else {
            assert(false);
        }
    }
}

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