#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin("gauss.in");
ofstream fout("gauss.out");

#define For(i, s, d) for(int i = s; i <= d; ++i)

const double EPS = 0.000000001;
const int MAXN = 300;

int n, m;
double A[MAXN][MAXN], X[MAXN];

void read() {
    fin >> n >> m;
    For (i, 1, n)
        For (j, 1, m + 1)
            fin >> A[i][j];
}

bool gauss() {
    int i = 1, j = 1, k;

    while (i <= n && j <= m) {
        for (k = i; k <= n; ++k)
            if (A[k][j] < -EPS || A[k][j] > EPS)
                break;

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

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

        for (int l = j + 1; l <= m + 1; ++l)
            A[i][l] /= A[i][j];
        A[i][j] = 1;

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

    for (int i = n; i > 0; --i) {
        for (int j = 1; j <= m + 1; ++j)
            if (A[i][j] < -EPS || A[i][j] > EPS) {

                if (j == m + 1) {
                    fout << "Imposibil\n";
                    return 0;
                }

                X[j] = A[i][m + 1];
                for (int k = j + 1; k <= m; ++k)
                    X[j] -= X[k] * A[i][k];
                break;
            }
    }
    return 1;
}

void print() {
    For (i, 1, m)
        fout << X[i] << " ";
}

int main() {
    read();
    if (gauss()) print();
    return 0;
}