#pragma GCC optimize "Ofast"
#include <vector>
#include <set>
#include <iostream>

using namespace std;
const int inf = 1e9-5;

int closest(int x, set<int> &a) {
	auto u = a.upper_bound(x);
	auto l = a.lower_bound(x);
	int ans = -inf;
	if (u != a.begin()) 
		ans = *prev(u);
	if (l != a.end()) 
		if (abs(ans-x) > abs(*l-x)) ans = *l;
	return ans;
}

int closest(int x, int y, int z) {
	if (abs(x-y) < abs(x-z)) return y;
	else return z;
}

int bs = 4;
struct Segtree {
	int n;
	vector<set<int>> tree;
	vector<int> vals;
	Segtree(int n): n(n), tree((2*n)>>bs), vals(n, -inf) { }

	void insert(int idx, int val) {
		vals[idx] = val;
		idx += n;
		idx >>= bs;
		while (idx > 0) {
			tree[idx].insert(val);
			idx /= 2;
		}
	}

	int find(int l, int r, int targ) {
		int sl = l, sr = r;
		int out = -inf;
		for (l=(l+n)>>(bs),r=(r+n)>>(bs); l < r; l /= 2, r /= 2) {
			if ((l&1)) {
				out = closest(targ, out, closest(targ, tree[l]));
				l++;
			}
			if (r&1) {
				r--;
				out = closest(targ, out, closest(targ, tree[r]));
			}
		}
		l = sl; r = sr;
		for (int i = l; i < min(r, l+(1<<bs)); i++) {
			out = closest(targ, out, vals[i]);
		}
		for (int i = r-1; i >= max(l+(1<<bs), r-(1<<bs)); i--) {
			out = closest(targ, out, vals[i]);
		}
		return out;
	}
};

void solve() {
	int n, m; cin >> n >> m;
	Segtree s(n);
	for (int i = 0; i < m; i++) {
		int type; cin >> type;
		if (type == 0) {
			int x, h; cin >> x>> h;
			s.insert(x-1, h);
		}
		else {
			int l, r, h; cin >> l >> r >> h;
			l--;
			int ans = s.find(l, r, h);
			if (ans == -inf) cout << -1 << '\n';
			else cout << abs(ans-h) << '\n';
		}
	}

}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int t; cin >> t;
	while (t--) solve();

}