Hypyt

#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef long double ld;

pair<int,int> dif(pair<int,int> from, pair<int,int> to){
	return {to.F-from.F, to.S-from.S};
}

vector<pair<int,int>> solve(int n, int m){
	assert(n>=m);
	int a=1;
	int b=n;
	pair<int,int> cp={1,1};
	vector<pair<int,int>> ans;
	while (a<b){
		for (int i=0;i<m;i++){
			pair<int,int> t1={a,i+1};
			pair<int,int> t2={b,m-i};
			if (t1 != cp){
				ans.push_back(dif(cp, t1));
			}
			ans.push_back(dif(t1, t2));
			cp=t2;
		}
		a++;
		b--;
	}
	if (b<a){
		return ans;
	}
	for (int i=0;i<m;i++){
		pair<int,int> t1={a,i+1};
		pair<int,int> t2={a,m-i};
		if (t1.S>t2.S){
			return ans;
		}
		if (t1!=cp){
			ans.push_back(dif(cp, t1));
		}
		if (t1==t2){
			return ans;
		}
		ans.push_back(dif(t1,t2));
		cp=t2;
	}
	assert(0);
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int tcs;
	cin>>tcs;
	for (int tc=0;tc<tcs;tc++){
		int n,m;
		cin>>n>>m;
		int iv=0;
		if (n<m){
			swap(n,m);
			iv=1;
		}
		auto sol=solve(n,m);
		assert((int)sol.size()==n*m-1);
		for (auto t : sol){
			if (iv){
				cout<<t.S<<" "<<t.F<<endl;
			} else {
				cout<<t.F<<" "<<t.S<<endl;
			}
		}
	}
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: ACCEPTED

Test 4

Group: 2

Verdict: ACCEPTED

Test 5

Group: 2

Verdict: ACCEPTED