#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <cmath>

using namespace std;

ifstream fin("gauss.in");
ofstream fout("gauss.out");

const int NMAX = 310;
const double EPS = 0.000000000001;

int N, M;
double A[NMAX][NMAX], SOL[NMAX];

int main()
{
    fin >> N >> M;
    for(int i = 1; i <= N; i++)
        for(int j = 1; j <= M + 1; j++)
            fin >> A[i][j];

    int i = 1, j = 1, k;
    while(i <= N && j <= M)
    {
        for(k = i; k <= N; k++)
            if(fabs(A[k][j]) > EPS) break;

        if(k == N + 1) {j++; continue;}
        else swap(A[k], A[i]);

        for(int jj = j + 1; jj <= M + 1; jj++)
            A[i][jj] /= A[i][j];
        A[i][j] = 1;

        for(int ii = i + 1; ii <= N; ii++)
        {
            for(int jj =  j + 1; jj <= M + 1; jj++)
                A[ii][jj] -= A[i][jj] * A[ii][j];
            A[ii][j] = 0;
        }

        i++; j++;
    }

    for(int i = N; i; i--)
    {
        for(int j = 1; j <= M + 1; j++)
        if(fabs(A[i][j]) > EPS)
        {
            if(j == M + 1)
            {
                fout << "Imposibil";
                return 0;
            }
            SOL[j] = A[i][M + 1];
            for(int jj = j + 1; jj <= M; jj++)
                SOL[j] -= SOL[jj] * A[i][jj];
            break;
        }
    }

    fout.precision(10);
    for(int i = 1; i <= M; i++)
        fout << fixed << SOL[i] << ' ';
    return 0;
}