#include <bits/stdc++.h>

using namespace std;

const long long mod = 1e9 + 7;
const int MaxN = 1e6 + 5;

struct Edge
{
    int u, v;
};

int n, m;
Edge edges[MaxN];

void Inp()
{
    cin >> n >> m;
    for (int x = 1; x <= m; x++)
    {
        cin >> edges[x].u >> edges[x].v;
    }
}

long long cur;
int parents[MaxN];
int sz[MaxN];
int sum[MaxN];
set<int> graph[MaxN];
set<int> rev[MaxN];
set<int> graphs[MaxN];
map<int, int> revs[MaxN];
vector<int> listing[MaxN];
vector<pair<int, int>> tmp;

int FindSet(int p)
{
    if (parents[p] == p)
    {
        return parents[p];
    }
    parents[p] = FindSet(parents[p]);
    return parents[p];
}

void UnionSet(int a, int b)
{
    a = FindSet(a);
    b = FindSet(b);
    if (a == b)
    {
        return;
    }
    if (sz[a] < sz[b])
    {
        swap(a, b);
    }
    parents[b] = a;
    cur += 2ll * sz[a] * sz[b];
    graph[a].erase(b);
    rev[a].erase(b);
    graph[b].erase(a);
    rev[b].erase(a);
    for (int x : graph[b])
    {
        if (rev[a].find(x) != rev[a].end())
        {
            tmp.push_back(make_pair(x, a));
        }
        rev[x].erase(b);
        rev[x].insert(a);
    }
    for (int x : rev[b])
    {
        if (graph[a].find(x) != graph[a].end())
        {
            tmp.push_back(make_pair(x, a));
        }
        graph[x].erase(b);
        graph[x].insert(a);
    }
    cur += 1ll * sum[a] * sz[b];
    for (pair<int, int> x : revs[b])
    {
        if (FindSet(x.first) == a)
        {
            continue;
        }
        auto p = revs[a].find(x.first);
        if (p == revs[a].end())
        {
            cur += sz[a];
        }
        else
        {
            graphs[x.first].erase(x.second);
            cur -= sz[b];
        }
    }
    for (int x : graph[b])
    {
        graph[a].insert(x);
    }
    for (int x : rev[b])
    {
        rev[a].insert(x);
    }
    //cout << sum[a] << " ";
    for (int x : graphs[b])
    {
        if (FindSet(x) != a)
        {
            graphs[a].insert(x);
        }
        else
        {
            sum[a]--;
            cur -= sz[a] + sz[b];
        }
        //cout << x << " ";
    }
    for (pair<int, int> x : revs[b])
    {
        if (FindSet(x.first) != a && revs[a].find(x.first) == revs[a].end())
        {
            revs[a].insert(x);
            sum[a]++;
        }
        else if (FindSet(x.first) == a)
        {
            cur -= sz[b];
        }
    }
    sz[a] += sz[b];
}

void Exc()
{
    for (int x = 1; x <= n; x++)
    {
        parents[x] = x;
        sz[x] = 1;
    }
    for (int x = 1; x <= m; x++)
    {
        int u = FindSet(edges[x].u), v = FindSet(edges[x].v);
        if (u == v)
        {
            cout << cur << "\n";
            continue;
        }
        if (revs[v].find(edges[x].u) != revs[v].end())
        {
            cout << cur << "\n";
            continue;
        }
        revs[v].insert(make_pair(edges[x].u, edges[x].v));
        graphs[u].insert(edges[x].v);
        sum[v]++;
        cur += sz[v];
        rev[v].insert(u);
        graph[u].insert(v);
        if (rev[u].find(v) != rev[u].end())
        {
            tmp.push_back(make_pair(u, v));
        }
        while (!tmp.empty())
        {
            pair<int, int> x = tmp.back();
            tmp.pop_back();
            UnionSet(x.first, x.second);
        }
        cout << cur << "\n";
    }
}

int main()
{
    //freopen("B.INP", "r", stdin);
    //freopen("B.OUT", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int test = 1;
    //cin >> test;
    for (int x = 1; x <= test; x++)
    {
        Inp();
        Exc();
    }
    return 0;
}