#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+5;
int n,q,p[N],ct[N],lc[N],a[N],m,rk[N],d[N];
ll ad[N],ans[N];
void solve(int t){
	scanf("%d",&m);
	for(int i=1;i<=m;++i)scanf("%d",&a[i]);
	for(int i=1;i<=m;++i)--d[p[a[i]]];
	for(int i=1;i<=m;++i){
		int x=a[i];
		ans[x]-=1ll*rk[x]*(q-t);
		rk[x]+=ct[p[x]]-lc[x]-d[p[x]+1];
		ans[x]+=1ll*rk[x]*(q-t);
		ans[x]+=1ll*t*(ct[p[x]]-lc[x])-ad[p[x]];
	}
	for(int i=1;i<=m;++i){
		int x=a[i];
		++ct[p[x]],ad[p[x]]+=t;
	}
	for(int i=1;i<=m;++i){
		int x=a[i];
		++p[x];
		lc[x]=ct[p[x]],ans[x]+=ad[p[x]];
		++d[p[x]];
	}
}
int main(){
	scanf("%d%d",&n,&q);
	d[0]=n;
	for(int i=1;i<=q;++i)solve(i-1);
	for(int i=1;i<=n;++i){
		ans[i]+=1ll*q*(ct[p[i]]-lc[i])-ad[p[i]];
		printf("%.12Lf\n",(long double)ans[i]/q+1);
	}
	return 0;
}