#include<bits/stdc++.h>
using i64 = long long;
const int inf = 1e9 + 10;
struct Block {
	int n, b;
	std::vector<int> blo, a;
	std::vector<std::set<int> > v;
	std::vector<std::set<int> > st;
	void init(int n) {
		this -> n = n;
		this -> b = (int) std::pow(n, 0.7);
		blo.assign(n + 1, 0);
		v.assign(n + 1, {});
		a.assign(n + 1, 0);
		st.assign(n + 1, {});
		for (int i = 1; i <= n; i ++) {
			blo[i] = (i - 1) / b + 1;
		}
	}
	void add(int x, int c) {
		int p = blo[x];
		v[p].insert(c);
		a[x] = c;
		st[p].insert(x);
	}
	int query(int l, int r, int c) {
		int res = inf, p = blo[l], q = blo[r];
		auto L = st[p].lower_bound(l);
		while (L != st[p].end() && *L <= r) {
			res = std::min(res, std::abs(a[*L] - c));
			L = next(L);
		}
		if (p == q) return res;
		auto R = st[q].begin();
		while (R != st[q].end() && *R <= r) {
			res = std::min(res, std::abs(a[*R] - c));
			R = next(R);
		}

		for (int i = p + 1; i < q; i ++) {
			auto it = v[i].lower_bound(c);
			if (it != v[i].end()) {
				res = std::min(res, std::abs(*it - c));
			}
			if (it != v[i].begin()) {
				it = prev(it);
				res = std::min(res, std::abs(*it - c));
			}
		}
		return res;
	}
};

void solve() {
	int n, m;
	std::cin >> n >> m;
	Block t;
	t.init(n);
	while (m --) {
		int op;
		std::cin >> op;
		if ( op & 1) {
			int l, r, v;
			std::cin >> l >> r >> v;
			int res = t.query(l, r, v);
			if (res == inf) {
				res = -1;
			}
			std::cout << res << '\n';
		} else {
			int x, v;
			std::cin >> x >> v;
			t.add(x, v);
		}
	}
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t = 1;
	std::cin >> t;
	while (t --) {
		solve();
	}
	return 0;
}