#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "gauss";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int NMAX = 300 + 5;
const int MMAX = 300 + 5;
const double EPS = 1e-5;

int N, M;
double A[NMAX][MMAX];
double X[MMAX];

void gauss() {
    int i, j, k;
    double x;

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

        if(i <= N) {
            for(k = 1; k <= M + 1; k++)
                swap(A[i][k], A[j][k]);

            for(i = j + 1; i <= N; i++) {
                x = A[j][j] / A[i][j];

                for(k = j; k <= M + 1; k++)
                    A[i][k] = A[i][k] * x - A[j][k];
            }
        }
    }
}

int interpretare() {
    int i, j, k;

    for(i = N; i >= 1; i--) {
        for(j = 1; j <= M; j++)
            if(fabs(A[i][j]) > EPS)
                break;

        if(j <= M) {
            for(k = M; k > j; k--)
                A[i][M + 1] -= A[i][k] * X[k];
            X[j] = A[i][M + 1] / A[i][j];
        } else if(fabs(A[i][M + 1]) > EPS)
            return 0;
    }

    return 1;
}

int main() {
    int i, j;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d%d", &N, &M);

    for(i = 1; i <= N; i++)
        for(j = 1; j <= M + 1; j++)
            scanf("%lf", &A[i][j]);

    gauss();

    if(interpretare())
        for(i = 1; i <= M; i++)
            printf("%.10f ", X[i]);
    else
        printf("Imposibil\n");

    return 0;
}