#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

const int sq = 1000;

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	int n,w;
	cin >> n >> w;
	vector<vector<int>>arr(n+1);
	vector<vector<int>>vals(w+1);
	for(int i = 1; i<=w; i++){
		int k;
		cin >> k;
		for(int j = 0; j<k; j++){
			int x;
			cin >> x;
			arr[x].push_back(i);
			vals[i].push_back(x);
		}
	}
	for(int i = 1; i<=n; i++){
		arr[i].push_back(w+1);
	}
	vector<int>c(n+1);
	vector<vector<int>>dp(w+1,vector<int>(505));
	dp[0][0] = n;
	for(int i = 1; i<=w; i++){
		for(int j = 0; j<=503; j++){
			dp[i][j] = dp[i-1][j];
		}
		for(int u: vals[i]){
			c[u]++;
			dp[i][min(c[u]-1,503ll)]--;
			dp[i][min(c[u],503ll)]++;
		}
	}
	for(int i = 1; i<=w; i++){
		for(int j = 503; j>=0; j--){
			dp[i][j] += dp[i-1][j]+dp[i][j+1]-dp[i-1][j+1];
		}
	}
	vector<int>ans(n+1);

	for(int i = 1; i<=n; i++){
		int cur = 0;
		if(arr[i].size() > 500)continue;
		for(int j = 0; j<arr[i].size(); j++){
			int idx = arr[i][j]-1;
			ans[i]+=dp[idx][j+1] - dp[cur][j+1];
			cur = idx;
		}
	}
	// for(int j = 1; j<=n; j++){
	// 	cout << ans[j] << ' ';
	// }
	// cout << '\n';
	for(int i = 0; i<=w; i++){
		for(int j = 0; j<505; j++){
			dp[i][j] = 0;
		}
	}
	vector<int>big;
	for(int i = 1; i<=n; i++){
		if(arr[i].size() > 500){
			big.push_back(i);
		}
	}
	dp[0][0] = n-big.size();
	for(int i = 1; i<=n; i++){
		c[i] = 0;
	}
	for(int i = 1; i<=w; i++){
		for(int j = 0; j<=503; j++){
			dp[i][j] = dp[i-1][j];
		}
		for(int u: vals[i]){
			if(arr[u].size() > 500)continue;
			c[u]++;
			dp[i][min(c[u]-1,503ll)]--;
			dp[i][min(c[u],503ll)]++;
		}
	}
	for(int i = 1; i<=w; i++){
		for(int j = 503; j>=0; j--){
			dp[i][j] += dp[i-1][j]+dp[i][j+1]-dp[i-1][j+1];
		}
	}
	vector<pii>order;
	for(int i: big){
		int cur = 0;
		for(int j = 0; j<arr[i].size(); j++){
			int idx = arr[i][j]-1;
			ans[i]+=dp[idx][j+1] - dp[cur][j+1];
			if(j==501)break;
			cur = idx;
		}
		order.push_back({i,0});
	}
	auto sorted = [&]() -> bool {
		for(int i = 1; i<order.size(); i++){
			if(order[i].second < order[i-1].second)return false;
		}
		return true;
	};
	auto fix = [&]() -> void {
		for(int i = 1; i<order.size(); i++){
			if(order[i].second < order[i-1].second){
				swap(order[i-1],order[i]);
			}
		}
	};
	for(int i = 1; i<=n; i++){
		c[i] = 0;
	}
	for(int i = 1; i<=w; i++){
		for(int u: vals[i]){
			c[u]++;
		}
		for(int j = 0; j<order.size(); j++){
			order[j].second = c[order[j].first];
		}
		while(!sorted()){
			fix();
		}
		int cur = 0;
		for(int j = (int)order.size()-1; j>=0; j--){
			if(j+1<order.size() && order[j].second < order[j+1].second){
				cur = (int)order.size()-1-j;
			}
			ans[order[j].first]+=cur;
		}
	}
	cout << fixed << setprecision(10);
	for(int i = 1; i<=n; i++){
		double d = w+ans[i];
		cout << d/w << '\n';
	}
	return 0;
}