#include <cstdio>
#include <stdexcept>
#include <algorithm>
#include <vector>
#include <cmath>

using namespace std;

FILE *f = fopen("gauss.in","r");
FILE *g = fopen("gauss.out","w");

///0-indexed
class GaussSolver{
	
private:
	
	const double EPS = 1e-10;
	int n;
	vector<double> solutions;
	vector< vector<double> > eq;
	vector<bool> free_elem;
	
public:

	GaussSolver(int n){
		this->n = n;
		this->solutions = vector<double>(n,0);
		this->eq = vector< vector<double> >();
		this->free_elem = vector<bool>(n,true);
	}
	
	void add(vector<double> &v){
		if((int)v.size() != n + 1){
			throw runtime_error("equation not valid");
		}		
		eq.push_back(v);
	}
	
	bool process(){
		int i = 0,j = 0;
		while(i < (int)eq.size() && j < n){
			
			bool found = false;
			
			for(int k = i;k < (int)eq.size();k++){
				if(abs(eq[k][j]) > EPS){
					swap(eq[k],eq[i]);
					found = true;
					
					double val = eq[i][j];
					for(auto &it:eq[i]){
						it /= val;
					}
					
					break;
				}					
			}
			
			if(!found){
				j++;
				continue;
			}
			
			for(int k = 0;k < (int)eq.size();k++){
				if(k == i){
					continue;
				}
				
				for(int l = 0;l <= n;l++){
					if(l != j){
						eq[k][l] -= eq[k][j] * eq[i][l];
					}
				}
				eq[k][j] = 0;
			}
			
			i++;
			j++;
		}
		
		for(int i = (int)eq.size() - 1;i >= 0;i--){
			for(int j = 0;j <= n;j++){
				if(abs(eq[i][j]) < EPS){
					continue;
				}
				
				if(j == n){
					return false;
				}
				
				if(abs(eq[i][j]) > EPS){
					solutions[j] = eq[i][n];
					for(int l = n - 1;l > i;l--){
						solutions[j] -= solutions[l] * eq[i][l];
					}
					free_elem[j] = false;
					break;
				}
			}
		}
		return true;
	}
	
	double get_sol(int pos){
		return solutions[pos];
	}
	
	int num_free(){
		int ans = 0;
		for(auto it:free_elem){
			ans += (it == true);
		}
		return ans;
	}
	
	bool is_free(int pos){
		return free_elem[pos];
	}

};

int n,m;

int main(){
	
	fscanf(f,"%d %d",&n,&m);
	
	GaussSolver stuff(m);
	
	for(int i = 0;i < n;i++){
		vector<double> eq(m + 1,0);
		for(int j = 0;j <= m;j++){
			int val;
			fscanf(f,"%d",&val);
			eq[j] = val;
		}
		stuff.add(eq);
	}
	
	if(!stuff.process()){
		fprintf(g,"Imposibil");
		return 0;
	}
	
	for(int i = 0;i < m;i++){
		fprintf(g,"%.10f ",stuff.get_sol(i));
	}
	
	fclose(f);
	fclose(g);
	
	return 0;
}