提供一组样例/gen

8 8 32
1 1 6 3 3
1 3 2 4 7
6 3 8 8 5
6 7 7 8 4
4 1 8 3 5
2 5 3 7 1
1 4 6 8 3
2 4 2 5 2
1 6 4 8
3 5 3 7
2 6 6 6
5 1 6 5
5 3 8 4
2 1 3 8
6 5 8 7
3 4 3 8
6 4 6 5
1 1 4 3
1 7 3 7
7 2 7 6
7 3 8 4
3 2 8 4
3 3 6 3
5 1 8 7
3 5 7 7
3 1 7 8
2 3 8 5
2 4 7 6
1 4 7 5
5 3 7 4
2 8 7 8
2 1 7 7
1 1 5 6
2 4 3 5
3 6 5 7
2 4 3 8
8 7 8 7
1 4 5 6
5 5 6 5

12
4
4
8
13
13
12
12
4
8
10
4
10
10
13
13
13
12
13
13
12
12
13
12
13
12
12
4
12
5
12
8

#include <bits/stdc++.h>
#define F(i, a, b) for (int i = (a); i <= (b); ++i)
#define dF(i, a, b) for (int i = (a); i >= (b); --i)
using namespace std;
using i64 = long long;
using arr = array<int, 2>;
const int N = 10;

int n = 8, m = 8, q = 32, K = 10;

mt19937 wy(time(0));
int qhj(int l, int r) { return wy() % (r - l + 1) + l;}

int main() {
  freopen("P6109.in", "w", stdout);
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cout << n << " " << m << " " << q << "\n";
  F(i, 1, m) {
    int l1 = qhj(1, n), l2 = qhj(1, n);
    int r1 = qhj(1, n), r2 = qhj(1, n);
    if (l1 > r1) swap(l1, r1);
    if (l2 > r2) swap(l2, r2);
    cout << l1 << " " << l2 << " " << r1 << " " << r2 << " " << qhj(1, K) << "\n";
  }
  F(i, 1, q) {
    int l1 = qhj(1, n), l2 = qhj(1, n);
    int r1 = qhj(1, n), r2 = qhj(1, n);
    if (l1 > r1) swap(l1, r1);
    if (l2 > r2) swap(l2, r2);
    cout << l1 << " " << l2 << " " << r1 << " " << r2 << "\n";
  }
  return 0;
}