#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back

const double eps = 1e-9;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    freopen("gauss.in", "r", stdin);
    freopen("gauss.out", "w", stdout);
    cout << setprecision(10) << fixed;
    int n, m;
    cin >> n >> m;
    vector a(n, vector<double>(m + 1));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j <= m; ++j) cin >> a[i][j];
    }
    vector<int> pivs;
    for (int j = 0, rnk = 0; j < m && rnk < n; ++j) {
        for (int i = rnk + 1; i < n; ++i) {
            if (abs(a[i][j]) > abs(a[rnk][j])) swap(a[i], a[rnk]);
        }
        for (int i = 0; i < n; ++i) {
            double coef = a[i][j] / a[rnk][j];
            if (i == rnk || abs(coef) < eps) continue;
            for (int k = 0; k <= m; ++k) a[i][k] -= coef * a[rnk][k];
        }
        pivs.pb(j); ++rnk;
    }
    for (int i = 0; i < n; ++i) {
        bool ok = false;
        for (int j = 0; j < m; ++j) {
            if (abs(a[i][j]) > eps) ok = true;
        }
        if (!ok) {
            cout << "Imposibil\n";
            return 0;
        }
    }
    vector<long double> sol(m, 0.);
    for (int i = 0; i < pivs.size(); ++i) sol[pivs[i]] = a[i][m] / a[i][pivs[i]];
    for (int i = 0; i < m; ++i) cout << sol[i] << " ";
    return 0;
}