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

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

using namespace std;

const int nmax = 305;
const double eps = 1e-10;

int n, m, i, j, k, l;
double a[nmax][nmax];
double sol[nmax];

bool dif(double x)
{
    return fabs(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("%lf", &a[i][j]);

    i = j = 1;
    while(i <= n && j <= m)
    {
        for(k = i; k <= n; k++)
            if(dif(a[k][j]))
                break;

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

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

        for(l = j + 1; l <= m + 1; l++)
            a[i][l] /= 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[k][j] * a[i][l];

            a[k][j] = 0.0;
        }

        i++;
        j++;
    }

    for(i = n; i; i--)
    {
        for(j = 1; j <= m + 1; j++)
            if(dif(a[i][j]))
                break;

        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];
    }

    for(i = 1; i <= m; i++)
        printf("%.10f ", sol[i]);

    return 0;
}