#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T>
inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
template <class T>
inline T sqr(T x) {
  return x * x;
}
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, 1, -1};
int t, n, p;
bool con[30][30];
int main() {
  cin >> t;
  while (t--) {
    memset((con), 0, sizeof(con));
    cin >> n >> p;
    vector<pair<int, int> > vec;
    for (int i = 1; i < n; ++i) {
      vec.push_back(make_pair(i, i + 1));
      con[i][i + 1] = con[i + 1][i] = true;
    }
    con[1][n] = con[n][1] = true;
    vec.push_back(make_pair(1, n));
    int r = n + p;
    for (int i = 1; i <= n; ++i) {
      for (int j = i + 1; j <= n; ++j) {
        if (!con[i][j]) {
          vec.push_back(make_pair(i, j));
          --r;
          if (r == 0) break;
        }
      }
      if (r == 0) break;
    }
    sort(vec.begin(), vec.end());
    for (int i = (0); i < (vec.size()); ++i)
      cout << vec[i].first << " " << vec[i].second << "\n";
  }
  return 0;
}
