#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 100;
vector<int> graph[maxn];

int main() {
    int n, m;
    cin >> n >> m;

    for(int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;

        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    vector<bool> visited(n, false);

    ll res = 0;
    for(int i = 0; i < n; i++) {
        if(!visited[i]) {
            ll size_of_component = 0;

            queue<int> q;
            q.push(i);
            visited[i] = true;
            while(!q.empty()) {
                int node = q.front();
                q.pop();

                size_of_component++;

                for(int i = 0; i < (int) graph[node].size(); i++) {
                    int neighbour = graph[node][i];
                    if(!visited[neighbour]) {
                        visited[neighbour] = true;
                        q.push(neighbour);
                    }
                }
            }
            res += size_of_component * (n - size_of_component);
        }
    }

    cout << res / 2<< endl;
    return 0;
}