#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
#define derr if(1) cerr

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << flush;
// END NO SAD

template<class T>
bool updmin(T& a, T b) {
  if(b < a) {
    a = b;
    return true;
  }
  return false;
}
template<class T>
bool updmax(T& a, T b) {
  if(b > a) {
    a = b;
    return true;
  }
  return false;
}
typedef int64_t ll;
const int VECTOR_SAMPLE_SIZE = 100;
const int BITSET_SAMPLE_SIZE = 4000;
mt19937 g1(0x14004);
const int AMT = 50000 + 500000 + 5;
bitset<BITSET_SAMPLE_SIZE> dp[AMT];
vector<uint16_t> exact[AMT];
void solve() {
  int n, q;
  cin >> n >> q;
  vector<int> v(n);
  iota(all(v), 0);
  shuffle(all(v), g1);
  for(int i = 0; i < n && i < BITSET_SAMPLE_SIZE; i++) dp[v[i]].set(i);
  for(int i = 0; i < n; i++) exact[i].pb(i);
  for(int i = 0; i < n+q; i++) exact[i].reserve(VECTOR_SAMPLE_SIZE);
  for(int qidx = 0; qidx < q; qidx++) {
    int a, b;
    cin >> a >> b;
    a--; b--;
    if(sz(exact[a]) == 0 || sz(exact[b]) == 0 || sz(exact[a]) + sz(exact[b]) > VECTOR_SAMPLE_SIZE) {
      dp[n+qidx] |= dp[a];
      dp[n+qidx] |= dp[b];
      cout << (n * ll(dp[n+qidx].count())) / BITSET_SAMPLE_SIZE << "\n";
    }
    else {
      for(int out: exact[a]) exact[n+qidx].pb(out);
      for(int out: exact[b]) exact[n+qidx].pb(out);
      sort(all(exact[n+qidx]));
      exact[n+qidx].erase(unique(all(exact[n+qidx])), exact[n+qidx].end());
      dp[n+qidx] |= dp[a];
      dp[n+qidx] |= dp[b];
      cout << sz(exact[n+qidx]) << "\n";
    }
    if(qidx%50 == 49 || qidx == q-1) cout << flush;
  }
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
// are you doing geometry in floating points

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
}