#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
const int MOD = 1073741824;
bool isPowerOfTwo(long long int x) { return x && (!(x & (x - 1))); }
void fastio() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
long long binpow(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
void solve() {
  int n, p;
  cin >> n >> p;
  int ed = 2 * n + p;
  int i = 1, j = 2;
  while (ed) {
    while (j <= n && ed) {
      cout << i << " " << j << "\n";
      j++;
      ed--;
    }
    i++;
    j = i + 1;
  }
}
int main() {
  int tc = 1;
  cin >> tc;
  while (tc--) {
    solve();
  }
}
