#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


struct Set {
  // max{ceil(log_64(n)), 1}
  int log64N, n;
  vector<unsigned long long> a[6];
  explicit Set(int n_ = 0) : n(n_) {
    assert(n >= 0);
    int m = n ? n : 1;
    for (int d = 0; ; ++d) {
      m = (m + 63) >> 6;
      a[d].assign(m, 0);
      if (m == 1) {
        log64N = d + 1;
        break;
      }
    }
  }
  bool empty() const {
    return !a[log64N - 1][0];
  }
  bool contains(int x) const {
    return (a[0][x >> 6] >> (x & 63)) & 1;
  }
  void insert(int x) {
    for (int d = 0; d < log64N; ++d) {
      const int q = x >> 6, r = x & 63;
      a[d][q] |= 1ULL << r;
      x = q;
    }
  }
  void erase(int x) {
    for (int d = 0; d < log64N; ++d) {
      const int q = x >> 6, r = x & 63;
      if ((a[d][q] &= ~(1ULL << r))) break;
      x = q;
    }
  }
  // max s.t. <= x (or -1)
  int prev(int x) const {
    if (x > n - 1) x = n - 1;
    for (int d = 0; d <= log64N; ++d) {
      if (x < 0) break;
      const int q = x >> 6, r = x & 63;
      const unsigned long long lower = a[d][q] << (63 - r);
      if (lower) {
        x -= __builtin_clzll(lower);
        for (int e = d; --e >= 0; ) x = x << 6 | (63 - __builtin_clzll(a[e][x]));
        return x;
      }
      x = q - 1;
    }
    return -1;
  }
  // min s.t. >= x (or n)
  int next(int x) const {
    if (x < 0) x = 0;
    for (int d = 0; d < log64N; ++d) {
      const int q = x >> 6, r = x & 63;
      if (static_cast<unsigned>(q) >= a[d].size()) break;
      const unsigned long long upper = a[d][q] >> r;
      if (upper) {
        x += __builtin_ctzll(upper);
        for (int e = d; --e >= 0; ) x = x << 6 | __builtin_ctzll(a[e][x]);
        return x;
      }
      x = q + 1;
    }
    return n;
  }
};

////////////////////////////////////////////////////////////////////////////////


/*
  problem
    query
      0 x h: add h to position x (which was empty)
      1 L R H: find distance from values in [L, R] to H
*/

constexpr int INF = 1001001001;

int N, Q;
vector<int> O, X, L, R, H;

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d", &N, &Q);
    O.assign(Q, -1);
    X.assign(Q, -1);
    L.assign(Q, -1);
    R.assign(Q, -1);
    H.assign(Q, -1);
    for (int q = 0; q < Q; ++q) {
      scanf("%d", &O[q]);
      if (O[q] == 0) {
        scanf("%d%d", &X[q], &H[q]);
        --X[q];
      } else if (O[q] == 1) {
        scanf("%d%d%d", &L[q], &R[q], &H[q]);
        --L[q];
      } else {
        assert(false);
      }
    }
    
    vector<pair<int, int>> hqs(Q);
    for (int q = 0; q < Q; ++q) hqs[q] = make_pair(H[q], q);
    sort(hqs.begin(), hqs.end());
    
    int segN;
    for (segN = 1; segN < N; segN <<= 1) {}
    vector<vector<int>> hss(segN << 1);
    
    // ((a, pos))
    vector<vector<pair<int, int>>> ess(Q);
    for (const auto &hq : hqs) {
      const int q = hq.second;
      if (O[q] == 0) {
        for (int a = segN + X[q]; a; a >>= 1) {
          ess[q].emplace_back(a, (int)hss[a].size());
          hss[a].push_back(H[q]);
        }
      } else if (O[q] == 1) {
        for (int a = segN + L[q], b = segN + R[q]; a < b; a >>= 1, b >>= 1) {
          if (a & 1) {
            ess[q].emplace_back(a, (int)hss[a].size());
            a++;
          }
          if (b & 1) {
            --b;
            ess[q].emplace_back(b, (int)hss[b].size());
          }
        }
      } else {
        assert(false);
      }
    }
    
    vector<Set> sets(segN << 1);
    for (int a = 1; a < segN << 1; ++a) {
      sets[a] = Set((int)hss[a].size());
    }
    
    for (int q = 0; q < Q; ++q) {
      if (O[q] == 0) {
        for (const auto &e : ess[q]) {
          sets[e.first].insert(e.second);
        }
      } else if (O[q] == 1) {
        int ans = INF;
        for (const auto &e : ess[q]) {
          const int a = e.first;
          const int l = sets[a].prev(e.second - 1);
          if (l >= 0) {
            chmin(ans, H[q] - hss[a][l]);
          }
          const int r = sets[a].next(e.second);
          if (r < sets[a].n) {
            chmin(ans, hss[a][r] - H[q]);
          }
        }
        printf("%d\n", (ans < INF) ? ans : -1);
      } else {
        assert(false);
      }
    }
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}