/// Containers Start
#include <algorithm>
#include <bitset>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
/// C Header Files
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <math.h>
#include <stdio.h>
/// Containers End

using namespace std;

/// Math Start
#define PI acos(-1.0)
#define Pi 3.141592653589793
#define EPS (1e-7)
#define INF (0x3f3f3f3f)
// #define INF 9e+18

/// Math End

/// Extra Start
#define nn '\n'
#define pb push_back
#define ull unsigned long long
#define ll long long
#define MOD 1000000007
#define sz(a) int((a).size())
#define space " "
#define All(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
/// Extra End

#define rep(i, n) for (int i = 0; i < n; i++)
#define Cini(a)                                                                \
    int a;                                                                     \
    cin >> a;
#define Cinii(a, b)                                                            \
    int a, b;                                                                  \
    cin >> a >> b;
#define Ciniii(a, b, c)                                                        \
    int a, b, c;                                                               \
    cin >> a >> b >> c;
#define Cins(s)                                                                \
    string s;                                                                  \
    cin >> s;
#define Cinss(s1, s2)                                                          \
    string s1, s2;                                                             \
    cin >> s1 >> s2;
#define Cinc(c)                                                                \
    char c;                                                                    \
    cin >> c;
/// Functions End

/// Debug Start
#define deb(x) cout << #x << ": " << x << endl
#define deb2(x, y) cout << #x << ": " << x << '\t' << #y << ": " << y << endl;
#define deb3(x, y, z)                                                          \
    cout << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": "   \
         << z << endl;
/// Debug End

// int dx[] = {-1, 0, 1, 0};
// int dy[] = {0, -1, 0, 1};
int dx[] = {-1, 0, 1};
int dy[] = {-1, 0, 1};

/**>>>>>>>>>>>>>>>>>>> END <<<<<<<<<<<<<<<<<<**/

/// template

#define int long long

class UnionFindTree {

  public:
    using size_type = std::uint_fast32_t;

  private:
    std::vector<std::pair<bool, size_type> > tree;

  public:
    UnionFindTree(const size_type size) : tree(size, std::make_pair(1, 1)) {}
    size_type find(const size_type x) {
        if (tree[x].first)
            return x;
        return tree[x].second = find(tree[x].second);
    }
    bool unite(size_type x, size_type y) {
        x = find(x);
        y = find(y);
        if (x == y)
            return false;
        if (tree[x].second < tree[y].second)
            std::swap(x, y);
        tree[x].second += tree[y].second;
        tree[y] = std::make_pair(0, x);
        return true;
    }

    bool same(const size_type x, const size_type y) {
        return find(x) == find(y);
    }
    size_type size(const size_type x) { return tree[find(x)].second; }
};

signed main(void) {
    cin.sync_with_stdio(false);
    cin.tie(0);
    Cinii(N, M);
    int in[M], out[M];
    vector<int> ans(M), sub(M);
    vector<int> com2(N + 5);
    rep(i, N + 1) { com2[i] = i * (i - 1) / 2LL; }
    rep(i, M) {
        cin >> in[i] >> out[i];
        in[i]--;
        out[i]--;
    }
    UnionFindTree uf = UnionFindTree(N);
    rep(i, M) {
        if (uf.same(in[M -1-i], out[M -1- i])) {
            sub.push_back(0);
        } else {
            int a = uf.size(in[M - 1 - i]);
            int b = uf.size(out[M - 1 - i]);
            sub.push_back(a * b);
        }
        uf.unite(in[M - 1 - i], out[M - 1 - i]);
    }
    reverse(All(sub));
    int count = 0;
    rep(i, M) {
        count += sub[i];
        cout << count << nn;
    }
    return 0;
}


Measured memory_bytes: 7536