/*
    Those without power, seek us!
    Those with power, fear us!
    We are the Order of the Black Knights!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned int
#define mod 1000000009LL
#define SQR 350
#define db double
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define od 100003
#define mod 666013
#define DIM 60010000
#define base 256
#define bas 255
#define mod 98999
#define N 310
#define inf 0x3f3f3f3f
#define pdd pair<double,double>
#define eps 1.e-10
using namespace std;
ifstream f("gauss.in");
ofstream g("gauss.out");
/*
    int dx[]={0,0,0,1,-1};
    int dy[]={0,1,-1,0,0};
*/
double A[N][N],x[N];
int n,m;
int z(double x)
{
    if(x<eps&&x>-eps)
        return 1;
    return 0;
}
int main ()
{
    f>>n>>m;
    FOR(i,1,n)
    FOR(j,1,m+1)
    f>>A[i][j];

    FOR(i,1,n)
    {
        int fnd=0;
        FOR(j,i,n)
        if(!z(A[i][j]))
        {
            FOR(k,i,m+1)
            swap(A[j][k],A[i][k]);
            fnd=1;
            break;
        }
        if(!fnd)
            continue;
        FOR(j,i+1,m+1)
        A[i][j]/=A[i][i];
        A[i][i]=1;

        FOR(j,i+1,n)
        {
            FOR(k,i+1,m+1)
            A[j][k]-=A[j][i]*A[i][k];
            A[j][i]=0;
        }
    }
    ROF(i,n,1)
    FOR(j,i,m+1)
    if(!z(A[i][j]))
    {
        if(j==m+1)
        {
            g<<"Imposibil";
            return 0;
        }
        x[j]=A[i][m+1];
        FOR(k,j+1,n)
        x[j]-=A[i][k]*x[k];
        x[j]/=A[i][j];
        break;
    }
    g<<fixed<<setprecision(11);
    FOR(i,1,m)
    g<<x[i]<<" ";
    return 0;
}