#include<cstdio>
#include<algorithm>
using namespace std;
const int nmax = 305;
const double eps = 0.000000000001;
int n,m,i,j,k,l,x;
double a[nmax][nmax],sol[nmax];
bool dif(double x) {return (x>eps || x<-eps);}
bool zero(double x ) {return (x>=-eps && x<=eps);}
int main()
{
	freopen("gauss.in","r",stdin);
	freopen("gauss.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)
        for(j=1;j<=m+1;j++)
        {
            scanf("%d",&x);
            a[i][j]=1.0*x;
        }
    for(i=1,j=1;i<=n && j<=m;)
    {
        for(k=i;k<=n;k++)
            if(dif(a[k][j])) break;

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

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

        for(k=j+1;k<=m+1;k++)
            a[i][k]/=a[i][j];
        a[i][j]=1.0;

        for(k=i+1;k<=n;k++)
        {
            for(l=j+1;l<=m+1;l++)
                a[k][l]-=a[i][l]*a[k][j];
            a[k][j]=0.0;
        }
        i++; j++;
    }
    for(i=n;i;i--)
        for(j=1;j<=m+1;j++)
            if(dif(a[i][j]))
            {
                if(j==m+1)
                {
                    printf("Imposibil\n");
                    return 0;
                }
                sol[j]=a[i][m+1];
                for(k=j+1;k<=m;k++)
                    sol[j]-=sol[k]*a[i][k];
                break;
            }
    for(i=1;i<=n;i++) printf("%lf ",sol[i]);
	return 0;
}