#include <iostream>
#include <cstdio>
#include <iomanip>
#include <cmath>

using namespace std;

const int N = 300 + 7;
int n, m, tr[N], tc[N];
double a[N][N], sol[N];

int main() {
  freopen ("gauss.in", "r", stdin);
  freopen ("gauss.out", "w", stdout);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m + 1; j++) {
      cin >> a[i][j];
    }
  }
  for (int i = 1; i <= n; i++) {
    tr[i] = -1;
  }
  for (int j = 1; j <= m; j++) {
    tc[j] = -1;
  }
  while (1) {
    int r = -1, c = -1;
    double mx = 0;
    for (int i = 1; i <= n; i++) {
      if (tr[i] == -1) {
        for (int j = 1; j <= m; j++) {
          if (tc[j] == -1 && fabs(a[i][j]) > mx) {
            r = i;
            c = j;
            mx = fabs(a[r][c]);
          }
        }
      }
    }
    if (r == -1) {
      break;
    }
    tr[r] = c;
    tc[c] = r;
    double x = a[r][c];
    for (int j = 1; j <= m + 1; j++) {
      a[r][j] /= x;
    }
    for (int i = 1; i <= n; i++) {
      if (i != r) {
        x = -a[i][c];
        for (int j = 1; j <= m + 1; j++) {
          a[i][j] += x * a[r][j];
        }
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    if (tr[i] != -1) {
      sol[tr[i]] = a[i][m + 1];
    }
  }
  for (int i = 1; i <= n; i++) {
    double sum = 0;
    for (int j = 1; j <= m; j++) {
      sum += sol[j] * a[i][j];
    }
    if (fabs(sum - a[i][m + 1]) > 1e-14) {
      cout << "Imposibil\n";
      return 0;
    }
  }
  for (int i = 1; i <= m; i++) {
    cout << fixed << setprecision(10) << sol[i] << " ";
  }
  cout << "\n";
  return 0;
}