LOSTSURVIVED

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX 100002
int C[MX],R[MX];
int gc(int a){return C[a]=(a==C[a]?a:gc(C[a]));}
bool con(int a,int b){
    if(gc(a)==gc(b))return 0;
    return R[C[a]]+=R[C[b]],C[C[b]]=C[a],1;
}
#define CLR (iota(C,C+N,0),fill(R,R+N,1))
int N,Q,a,b;
set<ii> S;
int main(void){
    scanf("%d%d",&N,&Q),CLR;
    F(N)S.insert({1,i});
    F(Q){
        scanf("%d%d",&a,&b),--a,--b;
        if(gc(a)^gc(b)){
            S.erase({R[gc(a)],gc(a)});
            S.erase({R[gc(b)],gc(b)});
            con(a,b);
            S.insert({R[gc(a)],gc(a)});
        }
        printf("%d\n",(*--S.end()).aa-(*S.begin()).aa);
    }
    return 0;
}