#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, M = 3, nBits = 2e8 + 5, MM = (1 << 16), MAX = 1111,
          OO = 0x3f3f3f3f, MOD = 998244353, inf = 1 << 30;
const double PI = acos(-1);
const long long INF = (long long)1e18;
long long GCD(long long a, long long b) { return !b ? a : GCD(b, a % b); }
long long LCM(long long x, long long y) { return (x * y / GCD(x, y)); }
long long fact(long long z) { return (z <= 1) ? 1 : z * fact(z - 1); }
int X[] = {0, 0, 1, -1, 1, -1, 1, -1};
int Y[] = {1, -1, 0, 0, 1, -1, -1, 1};
int n, q, y, x, t;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> q;
  while (q--) {
    cin >> x >> y;
    t = 2 * x + y;
    for (int i = 1; i <= x && t; ++i)
      for (int j = i + 1; j <= x && t; ++j) cout << i << " " << j << endl, --t;
  }
  return 0;
}
