#include <bits/stdc++.h>
#define pii              pair <int,int>
#define pll              pair <long long,long long>
#define sc               scanf
#define pf               printf
#define Pi               2*acos(0.0)
#define ms(a,b)          memset(a, b, sizeof(a))
#define pb(a)            push_back(a)
#define MP               make_pair
#define db               double
#define ll               long long
#define ull              unsigned long long
#define f                first
#define s                second
#define sqr(x)           (x)*(x)
#define VI               vector <int>
#define DBG              pf("Hi\n")
#define MOD              1000000007
#define SZ(a)            (int)a.size()
#define sf(a)            scanf("%d",&a)
#define sfl(a)           scanf("%lld",&a)
#define sff(a,b)         scanf("%d %d",&a,&b)
#define sffl(a,b)        scanf("%lld %lld",&a,&b)
#define sfff(a,b,c)      scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c)     scanf("%lld %lld %lld",&a,&b,&c)
#define loop(i,n)        for(int i=0;i<n;i++)
#define loop1(i,n)       for(int i=1;i<=n;i++)
#define REP(i,a,b)       for(int i=a;i<b;i++)
#define RREP(i,a,b)      for(int i=a;i>=b;i--)
#define intlim           2147483648
#define ull              unsigned long long
#define gcd(a, b)        __gcd(a, b)
#define lcm(a, b)        ((a)*((b)/gcd(a,b)))
#define mk(x1,y1) make_pair(x1, y1)
#define maxl 500010
#define psz 20
using namespace std;

/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

/*-----------------------Bitmask------------------*/
//int Set(int N,int pos){return N=N | (1<<pos);}
//int reset(int N,int pos){return N= N & ~(1<<pos);}
//bool check(int N,int pos){return (bool)(N & (1<<pos));}
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdin);
//ios_base::sync_with_stdio(false);
 //cin.tie(NULL);

int cnt=0,group[maxl],sz[maxl],cas=1;
long long total=0;

int find_root(int i)
{
   // cout<<"E  "<<i<<"  "<<group[i]<<endl;
    while( i != group[i] )
    {
        group[i]=group[group[i]];
        i=group[i];
    }
    return i;
}

int transfer_and_size(int ra, int rb)
{
    if(sz[ra]>=sz[rb])
    {
        sz[ra]+=sz[rb];
        group[rb]=group[ra];
    }
    else
    {
        sz[rb]+=sz[ra];
        group[ra]=group[rb];
    }
    // cout<<"W  "<<sz[ra]<<"  "<<sz[rb]<<endl;
}


int n,m;

void initialize(){

    for(int i=0; i<=n; i++) sz[i]=0, group[i] = i;
}


int main(){

    cin>>n>>m;

    initialize();

    //for(int i=1; i<=n; i++) cout<<"I  "<<find_root(i)<<endl;

    for(int i=0; i<m; i++){

        int k;
        scanf("%d",&k);
        int a[k+2];

        for(int i1=0; i1<k; i1++){

            scanf("%d",&a[i1]);

            int rr = find_root(a[i1]);

            if( rr == a[i1] && sz[rr] == 0){
                sz[rr]++;
            }
        }

        for (int j = 1; j < k; j++){

            int r1 = find_root(a[j-1]), r2 = find_root(a[j]);
            if(r1 == r2 ) continue;

            transfer_and_size(r1,r2);
        }
    }

     for(int i=1; i<=n; i++){
       // cout<<"T  "<<i<<"  "<<find_root(i)<<endl;
        printf("%d ",max(1,sz[find_root(i)]));
    }

    return 0;
}