#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_ON(bit, i) (((bit >> i) & 1) > 0)

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }
template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

const int INF = 1 << 30;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy4 = {0, -1, 0, 1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };


using namespace std;

class UnionFind {
public:
    int set_size;       // 集合の個数
private:
    vector<int> data;

public:
    UnionFind(int size) : data(size, -1), set_size(size) {}

    // xとyが同じ集合に属するか
    bool is_same_set(int x, int y) {
        return find_root(x) == find_root(y);
    }

    // xとyの属する集合を併合
    void union_set(int x, int y) {
        x = find_root(x);
        y = find_root(y);
        if (x == y) {
            return;
        }
        if (data[x] > data[y]) {
            swap(x, y);
        }

        data[x] += data[y];
        data[y] = x;
        set_size--;
    }

    // xの属する集合の要素数
    int size(int x) {
        return (-data[find_root(x)]);
    }

private:
    // 木の根を求める
    int find_root(int x) {
        if (data[x] < 0) {
            return x;
        }
        else {
            return data[x] = find_root(data[x]);
        }
    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    LL N, M;
    cin >> N >> M;

    auto v = make_v<pair<LL, LL>>(M);
    FOR(i, 0, M) {
        LL a, b;
        cin >> a >> b;
        a--; b--;
        v[i] = make_pair(a, b);
    }
    reverse(ALL(v));

    UnionFind uf(N);

    auto ans = make_v<LL>(0);
    LL now = sum_of_arithmetic_progression(1, 1, N - 1);
    FOE(e, v) {

        ans.emplace_back(now);

        LL a = e.first;
        LL b = e.second;

        if (not uf.is_same_set(a, b)) {
            LL a_size = uf.size(a);
            LL b_size = uf.size(b);

            LL rest = N - (a_size + b_size);
            now -= ((a_size * b_size) + a_size * rest + b_size * rest);

            now += (a_size + b_size) * rest;

            uf.union_set(a, b);
        }
    }

    reverse(ALL(ans));
    FOE(x, ans) {
        print(x);
    }

    return 0;
}

Measured memory_bytes: 4212