#include<stdio.h>
void solve()
{
	long long int n, x, y, a, b;
	scanf("%lld %lld %lld %lld %lld", &n, &x, &y, &a, &b);
	long long int cnt;
	if (x + y < 0)
	{
		if (a <= 0)
		{
			printf("%lld %lld\n", x + n * a, y);
			return;
		}
		cnt = (-x - y + a - 1) / a;
		if (cnt >= n)
		{
			printf("%lld %lld\n", x + n * a, y);
			return;
		}
		n -= cnt;
		x += cnt * a;
	}
	if (b <= 0)
	{
		printf("%lld %lld\n", x, y - n * b);
		return;
	}
	cnt = (x + y + b) / b;
	if (cnt >= n)
	{
		printf("%lld %lld\n", x, y - n * b);
		return;
	}
	n -= cnt;
	y -= cnt * b;
	if (a <= 0)
	{
		printf("%lld %lld\n", x + n * a, y);
		return;
	}
	long long int z = x + y - n * b;
	cnt = (-b - z + a + b - 1) / (a + b);
	x += cnt * a;
	y -= (n - cnt) * b;
	printf("%lld %lld\n", x, y);
	return;
}
int main()
{
	int t;
	scanf("%d", &t);
	for (; t > 0; t--)
		solve();
	return 0;
}