//ALEXANDRU MICLEA

#include <vector>
#include <algorithm>
#include <string>
#include <string.h>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <cmath>
#include <assert.h>
#include <stack>
#include <bitset>
#include <random>
#include <chrono>
#include <assert.h>
#include <iostream>

using namespace std;
using ll = long long;

#define fast_cin() 	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

//VARIABLES

double v[305][305];
double ans[305];
const double EPS = 1e-9;

//FUNCTIONS



//MAIN
int main() {

	#ifdef INFOARENA
		freopen("gauss.in", "r", stdin);
		freopen("gauss.out", "w", stdout);
	#endif

	fast_cin();

	int n, m; cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m + 1; j++) {
			cin >> v[i][j];
		}
	}

	int i = 1, j = 1, k;
	double aux;

	while (i <= n && j <= m) {

		for (k = i; k <= n; k++) {
			if (v[k][j] < -EPS || v[k][j] > EPS) break;
		}

		if (k == n + 1) {
			j++;
			continue;
		}

		if (k != i) {
			for (int l = 1; l <= m + 1; l++) {
				swap(v[i][l], v[k][l]);
			}
		}

		for (int u = i + 1; u <= n; u++) {
			for (int l = j + 1; l <= m + 1; l++) {
				v[u][l] -= v[u][j] * v[i][l];
			}
			v[u][j] = 0;
		}
		i++, j++;
	}

	for (int i = n; i > 0; i--) {
		for (int j = 1; j <= m + 1; j++) {
			if (v[i][j] > EPS || v[i][j] < -EPS) {
				if (j == m + 1) {
					cout << "Imposibil\n";
					return 0;
				}
				ans[j] = v[i][m + 1];
				for (int k = j + 1; k <= m; k++) {
					ans[j] -= ans[k] * v[i][k];
				}
				break;
			}
		}
	}

	for (int i = 1; i <= m; i++) {
		cout << setprecision(6) << fixed << ans[i] << ' ';
	}

	return 0;
}