//ALEX ENACHE

#include <vector>
#include <algorithm>
#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>

using namespace std;

#define mp make_pair
#define sz(x) (int)((x).size())
#define all(x) (x).begin(),(x).end()
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}

typedef pair< int, int > pii;
typedef pair< long long, long long > pll;
typedef long long ll;
typedef vector< int > vi;
typedef vector< ll > vll;
typedef vector< pii > vpii;
typedef vector< pll > vpll;
typedef long double ld;
typedef vector< ld > vld;

ll lgput(ll a, ll b, ll mod) {
    ll ret = 1;
    while( b ){
        if(b & 1) ret = (ret * a) % mod;
        a = (a * a) % mod;
        b >>= 1;
    }

    return (ret%mod);
}

inline ll inv(ll x, ll MOD) {
    return lgput(x, MOD - 2, MOD);
}

const ld PI = acos(-1);
const ld eps = 1e-6;

//-------------------------------------------------------------------

//#include <iostream>
#include <fstream>
ifstream cin ("gauss.in");ofstream cout ("gauss.out");

int n , m;
double v[310][310];
double ans[310];

bool exist (double nr){
    return (nr < -eps) || (nr > eps);
}


int main() {

    //freopen("input", "r", stdin);freopen("output", "w", stdout);

    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cout << setprecision(10) << fixed;
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    srand(time(NULL));

    cin>>n>>m;

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

    //transformare matrice (zerouri sub diagonala principala)

    for (int j=1; j<=m; j++){
        int pnt = j;
        while (pnt <= n){
            if (exist(v[pnt][j])){
                swap(v[j] , v[pnt]);
                break;
            }
            pnt++;
        }

        for (int i=j+1; i<=n; i++){
            double cnst = v[i][j] / v[j][j];
            for (int k=j; k<=m+1; k++){
                v[i][k] -= v[j][k] * cnst;
            }
        }
    }

    /*for (int i=1; i<=n; i++){
        for (int j=1; j<=m+1; j++){
            cout<<v[i][j]<<" ";
        }
        cout<<'\n';
    }
    cout<<'\n';*/

    //aflat raspuns

    for (int i=n; i>=1; i--){
        double sum = 0;
        for (int j=i+1; j<=m; j++){
            if (exist(v[i][j])){
                sum += v[i][j] * ans[j];
            }
        }
        if (i > m && exist(v[i][m+1])){
            cout<<"Imposibil"<<'\n';
        }
        if (!exist(v[i][i]) && exist(v[i][m+1] - sum)){
            cout<<"Imposibil"<<'\n';
        }
        ans[i] = (v[i][m+1] - sum) / v[i][i];
    }

    for (int i=1; i<=m; i++){
        cout<<ans[i]<<" ";
    }


    return 0;
}