nangluongvutrusol

#include <iostream>

using namespace std;

int n;
double map[100][100];
double A, B, C;
double ans;
int visit[100][100];
double chatnhiphan(double k) {
	double lo = 0.000000000;
	double hi = 10000000000.000000000;
	
	while (lo < hi) {
		double mid = (lo + hi) / 2;
		
		if (A * mid * mid * mid + B * mid * mid + C - k <= k * 0.0000000001 && A * mid * mid * mid + B * mid * mid + C - k >= 0) {
			
			return mid;
		}
		
		if (A * mid * mid * mid + B * mid * mid + C > k) {
			hi = mid;
		}
		else {
			lo = mid;
		}
	}
	
	return lo;
}

void prim() {
	visit[1] = 1;
	int count = 0;
	
}

void solve(int testcase) {
	cin >> n;
	cin >> A >> B >> C;
	
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			cin >> map[i][j];
		}
	}
	
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			map[i][j] = chatnhiphan(map[i][j]);
		}
	}
	
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			cout << map[i][j] << " ";
		}
		cout  << endl;
	}
	
}

int main() {
	
	freopen("Text.txt", "r", stdin);
	int t; cin >> t;
	
	for (int i = 1; i <= t; i++) {
		solve(i);
	}
	return 0;
}