#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;

uint64_t fhash(uint64_t x) {
    x = ((x >> 33) ^ x) * 0xff51afd7ed558ccd;
    x = ((x >> 33) ^ x) * 0xc4ceb9fe1a85ec53;
    x = (x >> 33) ^ x;
    return x;
}

class HyperLogLogPlusPlus {
private:
    size_t precision; // Number of bits used for buckets (registers)
    size_t numRegisters;
    std::vector<uint8_t> registers;
    double alphaMM;

    double computeAlphaMM(size_t m) {
        if (m == 16) return 0.673 * m * m;
        if (m == 32) return 0.697 * m * m;
        if (m == 64) return 0.709 * m * m;
        return (0.7213 / (1 + 1.079 / m)) * m * m;
    }

    uint8_t countLeadingZeros(uint64_t x) {
        return x ? __builtin_clzll(x) + 1 : 64;
    }

    double biasCorrection(double estimate) {
        return estimate;
    }

public:
    explicit HyperLogLogPlusPlus(size_t precision = 9) : precision(precision), numRegisters(1 << precision) {

        registers.resize(numRegisters, 0);
        alphaMM = computeAlphaMM(numRegisters);
    }

    void add(uint64_t value) {
        uint64_t hashValue = fhash(value);
        size_t index = (hashValue >> (64 - precision)) % numRegisters;
        uint64_t remainingBits = hashValue << precision;
        uint8_t leadingZeros = countLeadingZeros(remainingBits) + 1;
        registers[index] = std::max(registers[index], leadingZeros);
    }

    void merge(const HyperLogLogPlusPlus& other) {
        for (size_t i = 0; i < numRegisters; ++i) {
            registers[i] = std::max(registers[i], other.registers[i]);
        }
    }

    double estimate() {
        double sum = 0.0;
        size_t zeroCount = 0;

        for (uint8_t reg : registers) {
            sum += pow(2, -double(reg));
            if (reg == 0) zeroCount++;
        }

        double rawEstimate = alphaMM / sum;
        if (rawEstimate <= 2.5 * numRegisters && zeroCount > 0) {
            rawEstimate = numRegisters * log(static_cast<double>(numRegisters) / zeroCount);
        }
        return biasCorrection(rawEstimate);
    }
};

HyperLogLogPlusPlus hllpp[700000];
void solve() {
  int n, q;
  cin >> n >> q;
  for(int i = 0; i < n; i++) hllpp[i].add(i+1);
  for(int qidx = 0; qidx < q; qidx++) {
    int a, b;
    cin >> a >> b;
    a--; b--;
    hllpp[n+qidx].merge(hllpp[a]);
    hllpp[n+qidx].merge(hllpp[b]);
    cout << int(hllpp[n+qidx].estimate()) << "\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();
}