#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
using namespace std;
#define lint long long int
/*
vector<char>al(26);
al = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char>AL(26);
AL = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
*/


int main() {
	double H, W;
	cin >> H >> W;
	vector<vector<double>>vec(H, vector<double>(W));
	for (double i = 0; i < H; i++) {
		for (double j = 0; j < W; j++) {
			cin >> vec[i][j];
		}
	}
	vector<double>ans1(H);//左
	for (double i = 1; i <= H; i++) {//赤
		for (double j = 1; i <= H; j++) {//縦
			for (double k = 1; k <= W; k++) {//横
				if (vec[j][k] == 1) {
					ans1[i] += sqrt(pow(k, 2)+pow(i-j, 2));
				}
			}
		}
	}
	for (int i = 0; i < H; i++) {
		cout << ans1[i] << endl;
	}
}