#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;

#define F first
#define S second

const int MAXN = 1e3 + 10;

int n, k, a[MAXN][MAXN];
ld p[2][MAXN];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(12);

	int te = 1;
	while (te--){
		cin >> n >> k;
		memset(p, 0, sizeof(p));
		int cur = 0;
		for (int i = 0; i < n; i++, cur ^= 1) {
			memset(p[!cur], 0, sizeof(p[!cur]));
			int sm = 0;
			for (int j = 0; j < k; j++)
				cin >> a[i][j], sm += a[i][j];
			
			for (int j = 0; j < k; j++)
				p[!cur][j] = p[cur][j] * (a[i][j]+1)/ (sm + bool(i)) + 
					(1. - p[cur][j]) * (a[i][j])/ (sm + bool(i));
		}

		for (int i = 0; i < k; i++)
			cout << p[cur][i] << " ";
		cout << "\n";
	}
	return 0;
}