#include <fstream>
#include <algorithm>
#include <iomanip>
#include <cmath>

using namespace std;

const int NMAX = 305;
const long double EPS1 = 1e-10;
const long double EPS2 = 1e-4;
const long double INF = 1.0 * 1e10;

ifstream cin("gauss.in");
ofstream cout("gauss.out");

long double a[NMAX][NMAX], init[NMAX][NMAX];
long double ans[NMAX];

bool IsZero1(long double a)
{
    return fabs(a) <= EPS1;
}

bool IsZero2(long double a)
{
    return fabs(a) <= EPS2;
}

void SwapLines(int x, int y, int m)
{
    for(int i = 1; i <= m; ++i) {
        swap(a[x][i], a[y][i]);
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    m++;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            cin >> a[i][j];
            init[i][j] = a[i][j];
        }
    }
    for (int c = 1; c < m; ++c) {
        bool dist = 0;
        for (int l = c; l <= n; ++l) {
            if (!IsZero1(a[l][c])) {
                dist = 1;
                long double rad1 = a[l][c];
                for (int cc = 1; cc <= m; ++cc) {
                    a[l][cc] = a[l][cc] / rad1;
                }
                for (int ll = 1; ll <= n; ++ll) {
                    long double rad2 = a[ll][c];
                    for (int cc = c; cc <= m; ++cc) {
                        if (ll != l) {
                            a[ll][cc] = a[ll][cc] - rad2 * a[l][cc];
                            if (IsZero1(a[ll][cc]))
                                a[ll][cc] = 0.0;
                        }
                    }
                }
                SwapLines(l, c, m);
                break;
            }
        }
        if (dist == 0)
            ans[c] = 0.0;
        /*   for (int i = 1; i <= n; ++i) {
               for (int j = 1; j <= m; ++j) {
                   cout << fixed << setprecision(6) << a[i][j] << " ";
               }
               cout << "\n";
           }
           cout << "\n";*/
    }
    for (int i = n + 1; i < m; ++i) {
        ans[i] = 0;
    }
    for (int l = 1; l <= n; ++l) {
        int cnt = 0;
        for (int c = 1; c < m; ++c) {
            if (IsZero1(a[l][c] - 1.0)) {
                cnt++;
                ans[c] = a[l][m];
            }
        }
        if (cnt == 0 && !IsZero1(a[l][m])) {
            cout << "Imposibil\n";
            return 0;
        }
    }
    for(int l = 1; l <= n; ++l) {
        long double sum = 0.0;
        for(int c = 1; c < m; ++c) {
            sum += 1.0 * ans[c] * init[l][c];
        }
        if(!IsZero2(init[l][m] - sum)) {
            cout << "Imposibil\n";
//           bool aaa = IsZero2(init[l][m] - sum);
            return 0;
        }
    }
    for(int i = 1; i < m; ++i) {
        cout << fixed << setprecision(8) << ans[i] << " ";
    }
    return 0;
}