#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef double db;

tuple<LL, LL, LL> gcdExt(LL a, LL b)
{
	LL x1 = 1, y1 = 0;
	LL x2 = 0, y2 = 1;
	while (b)
	{
		LL k = a / b;
		x1 -= k * x2;
		y1 -= k * y2;
		a %= b;
		swap(a, b);
		swap(x1, x2);
		swap(y1, y2);
	}
	return {a, x1, y1};
}

struct Pt
{
	LL x, y;
	Pt operator-(const Pt& p)
	{
		return {x - p.x, y - p.y};
	}
};

LL cross(const Pt& p, const Pt& q)
{
	return p.x * q.y - p.y * q.x;
}

LL areaPolygon(const vector<Pt>& v)
{
	LL area = 0;
	int n = SZ(v);
	FOR(i, 0, n)
		area += cross(v[i], v[(i + 1) % n]);
	return area;
}

void solve()
{
	LL xbb, ybb;
	cin >> xbb >> ybb;
	auto [g, y, x] = gcdExt(xbb, ybb);
	vector<Pt> ans;
	if (g <= 50000)
	{
		while (y <= 0)
		{
			y += ybb / g;
			x -= xbb / g;
		}
		x *= -1;
		assert(0 <= x && x <= xbb && 0 <= y && y <= ybb);
		ans = {{0, 0}, {xbb, ybb}, {x, y}};
	}
	else
		ans = {{0, 0}, {xbb, ybb - 1}, {xbb / g, ybb / g}, {xbb - 1, ybb}};
	LL area = areaPolygon(ans);
	assert(0 <= area && area <= 50000);
	cout << SZ(ans) << "\n";
	for (const Pt& p : ans)
		cout << p.x << " " << p.y << "\n";
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	while (n--)
		solve();
	return 0;
}