#include <bits/stdc++.h>
#define fi first
#define se second
typedef long long ll;
using namespace std;
const int N = 3e5 + 10, INF = 0x3f3f3f3f;

int n, m;
pair<int, int> a[N];

struct Data {
    int l, r; ll val;
    Data(int l = -INF, int r = INF, int val = -1) : l(l), r(r), val(val) {}
};

Data merge(const Data& x, const Data& y) {
    if (x.val == -1 && y.val == -1) {
        if (x.l > y.r) return Data(x.l, y.r, x.l - y.r);
        if (x.r < y.l) return Data(x.r, y.l, 0);
        return Data(max(x.l, y.l), min(x.r, y.r));
    }
    if (x.val == -1) {
        if (y.l < x.l) return Data(x.l, y.r, y.val + x.l - y.l);
        if (y.l > x.r) return Data(x.r, y.r, y.val);
        return y;
    }
    if (y.val == -1) {
        if (x.r > y.r) return Data(x.l, y.r, x.val + x.r - y.r);
        if (x.r < y.l) return Data(x.l, y.l, x.val);
        return x;
    }
    return Data(x.l, y.r, x.val + y.val + max(0, x.r - y.l));
}

struct SegmentTree {
    #define lc (p << 1)
    #define rc (p << 1 | 1)
    #define mid ((L + R) >> 1)

    Data dat[N << 2];
    void upd(int p) {dat[p] = merge(dat[lc], dat[rc]);}

    void change(int p, int L, int R, int x, Data k) {
        if (L == R) {
            dat[p] = k;
            return;
        }
        if (x <= mid) change(lc, L, mid, x, k);
        else change(rc, mid + 1, R, x, k);
        upd(p);
    }

    Data ask(int p, int L, int R, int l, int r) {
        if (l <= L && R <= r) return dat[p];
        if (r <= mid) return ask(lc, L, mid, l, r);
        else if (l > mid) return ask(rc, mid + 1, R, l, r);
        else return merge(ask(lc, L, mid, l, r), ask(rc, mid + 1, R, l, r));
    }
    #undef lc
    #undef rc
    #undef mid
} T[2];

int main() {
    cin >> n >> m;
    for (int i = 1; i < n; i++) {
        cin >> a[i].fi >> a[i].se;
        T[0].change(1, 1, n - 1, i, Data(a[i].fi - i, a[i].se - i - 1));
    }
    reverse(a + 1, a + n);
    for (int i = 1; i < n; i++) 
        T[1].change(1, 1, n - 1, i, Data(a[i].fi - i, a[i].se - i - 1));
    while (m--) {
        int op;
        cin >> op;
        if (op == 1) {
            int x, l, r; cin >> x >> l >> r;
            T[0].change(1, 1, n - 1, x, Data(l - x, r - x - 1));
            x = n - x;
            T[1].change(1, 1, n - 1, x, Data(l - x, r - x - 1));
        } else if (op == 2) {
            int a, b, c, d; cin >> a >> b >> c >> d;
            if (a == c) cout << max(0, b - d) << endl;
            else if (a < c) {
                Data now = T[0].ask(1, 1, n - 1, a, c - 1);
                now = merge(Data(b - a, b - a), now);
                now = merge(now, Data(d - c, d - c));
                cout << now.val << endl;
            } else {
                a = n - a + 1, c = n - c + 1;
                Data now = T[1].ask(1, 1, n - 1, a, c - 1);
                now = merge(Data(b - a, b - a), now);
                now = merge(now, Data(d - c, d - c));
                cout << now.val << endl;
            }
        }
    }
    return 0;
}