#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int n, q;
const int maxN = 5e4 + 10;
int a[maxN], b[maxN];
typedef vector<pair<ll,ll>> node;
node t[4 * maxN];
node merge(const node& a, const node& b) {
    node c;
    for (auto& x : a) {
        for (auto& y : b) {
//            cout << x.first << " " << y.first << " " << x.second << " " << y.second << endl;
            c.emplace_back(x.first + y.first, x.second + y.second + 1);
        }
    }
    sort(c.begin(), c.end());
    node ans;
    ll max_r = -1e18;
    ll L = -1e18;
    for (auto& it : c) {
        if (it.first > max_r) {
            if (max_r >= 0) {
                ans.emplace_back(L, max_r - 1);
            }
            L = it.first;
            max_r = it.second;
        }
        else {
            max_r = max(max_r, it.second);
        }
    }
    if (max_r >= 0) {
        ans.emplace_back(L, max_r - 1);
    }
    return ans;
}
void build(int v, int tl, int tr) {
    if (tl == tr) {
        t[v] = {{0, 0}, {a[tl], b[tl]}};
        return;
    }
    int tm = (tl + tr) / 2;
    build(2 * v, tl, tm);
    build(2 * v + 1, tm + 1, tr);
    t[v] = merge(t[2 * v], t[2 * v + 1]);
}
void upd(int v, int tl, int tr, int pos) {
    if (tl == tr) {
        t[v] = {{0, 0}, {a[tl], b[tl]}};
        return;
    }
    int tm = (tl + tr) / 2;
    if (pos <= tm) upd(2 * v, tl, tm, pos);
    else upd(2 * v + 1, tm + 1, tr, pos);
    t[v] = merge(t[2 * v], t[2 * v + 1]);
}
node get(int v, int tl, int tr, int l, int r) {
    if (tr < l || tl > r) {
        node p = {{0, 0}};
        return p;
    }
    if (l <= tl && tr <= r) {
//        cout << " HI " << l << " " << r << " " << tl << " " << tr << endl;
        return t[v];
    }
    int tm = (tl + tr) / 2;
    return merge(get(2 * v, tl, tm, l, r), get(2 * v + 1, tm + 1, tr, l, r));
}
void solve() {
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
    }
    build(1, 1, n);
    while (q--) {
        int tp;
        cin >> tp;
        if (tp == 1) {
            int k, x, y;
            cin >> k >> x >> y;
            a[k] = x;
            b[k] = y;
            upd(1, 1, n, k);
        }
        else {
            int l, r;
            cin >> l >> r;
//            cout << l << " " << r << " ???? " << endl;
            auto nd = get(1, 1, n, l, r);
            ll ans = 0;
            for (auto& it : nd) {
//                cout << it.first << " " << it.second << " ??? " << endl;
                ans += it.second - it.first + 1;
            }
//            exit(0);
            cout << ans << '\n';
        }

    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    int tst;
    cin >> tst;
    while (tst--) {
        solve();
    }
    return 0;
}