#include <bits/stdc++.h>

using namespace std;

#define DUMP(x) std::cerr << (#x) << " = " << (x) << "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define ALL(r) r.begin(), r.end()
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define IMP cout << "IMPOSSIBLE" << endl
#define Imp cout << "Impossible" << endl
#define imp cout << "impossible" << endl
#define M1 cout << "-1" << endl
#define pb push_back
#define eb emplace_back
#define fi first
#define se second

template <typename T>
ostream &operator<<(ostream &os, vector<T> &v)
{
    os << "{";
    rep(i, v.size()) os << v[i] << (i == (int)v.size() - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &p)
{
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
template <typename T>
T dup(T x, T y)
{
    return (x + y - 1) / y;
};
template <typename A, size_t N, typename T>
inline void arrayFill(A (&array)[N], const T &val) { std::fill((T *)array, (T *)(array + N), val); }
struct in
{
    const size_t n = 0;
    in() = default;
    in(size_t n) : n(n){};
    template <typename T>
    operator T()
    {
        T ret;
        cin >> ret;
        return ret;
    }
    template <typename T>
    operator vector<T>()
    {
        assert(n != 0);
        vector<T> ret(n);
        for (auto &x : ret)
            cin >> x;
        return ret;
    }
};

using ll = int64_t;
using vint = vector<int32_t>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pint = pair<int32_t, int32_t>;
using vpint = vector<pint>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using setint = set<int32_t>;
using setstr = set<string>;
using qint = queue<int32_t>;
using qpint = queue<pint>;

constexpr std::int32_t INF = 1001001001;
constexpr std::int64_t LINF = 1001001001001001001;

class UnionFind
{
public:
    UnionFind(const int n) : par(n), rank(n, 0), sz(n, 1)
    {
        rep(i, n) par[i] = i; // 全てが根であるとして初期化
    }

    // x が属する木の根を求める
    int find(const int x)
    {
        if (par[x] == x)
            return x;
        return par[x] = find(par[x]);
    }

    // x と y を併合する
    void unite(int x, int y)
    {
        x = find(x);
        y = find(y);
        if (x == y)
            return;

        if (rank[x] < rank[y])
        {
            par[x] = y;
            sz[y] += sz[x];
        }
        else
        {
            par[y] = x;
            sz[x] += sz[y];
            if (rank[x] == rank[y])
            {
                ++rank[x];
            }
        }
    }

    // x と y が同じ木に属するか
    bool same(const int x, const int y)
    {
        return find(x) == find(y);
    }

    int size(const int x)
    {
        return sz[find(x)];
    }

private:
    vint par;  // 親
    vint rank; // ランク（根からの距離）
    vint sz;   // 木の要素数
};

void Main()
{
    int n = in(), m = in();
    vint a(m), b(m);
    rep(i, m)
    {
        cin >> a[i] >> b[i];
        --a[i], --b[i];
    }

    UnionFind uf(n);

    vll ans(m);
    ll tmp = (ll)n * (n - 1) / 2;
    rep(i, m)
    {
        ans[m - i - 1] = tmp;

        int ca = a[m - i - 1];
        int cb = b[m - i - 1];

        if (!uf.same(ca, cb))
        {
            tmp -= (ll)uf.size(ca) * uf.size(cb);
            uf.unite(ca, cb);
        }
    }
    for (auto e : ans)
        cout << e << endl;
}

signed main()
{
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(15);
    Main();
    return 0;
}


Measured memory_bytes: 4096