#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> pip;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS = 1e-9;

int conv[4][4] = {
	{1, 2, 3, 4},
	{2, -1, 4, -3},
	{3, -4, -1, 2},
	{4, 3, -2, -1}
};

int main() {
	int n;
	while (cin >> n, n) {
		while (n--) {
			int d[2][4];
			REP(i, 2) REP(j, 4) scanf("%d", &d[i][j]);
			
			int ans[4] = {};
			REP(i, 4) REP(j, 4) {
				int pro = d[0][i] * d[1][j];
				int c = conv[i][j];
				ans[abs(c) - 1] += pro * (c < 0 ? -1 : 1);
			}
			
			REP(i, 4) printf("%d%c", ans[i], i == 3 ? '\n' : ' ');
		}
	}
	return 0;
}