#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 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);
    ll res = 0;
    for(int i = 0; i < n; i++) {
        if(!visited[i]) {
            visited[i] = true;
            queue<int> q;
            q.push(i);

            ll component_size = 0;
            while(!q.empty()) {
                int node = q.front();
                q.pop();
                component_size++;
                for(int i = 0; i < (int) graph[node].size(); i++) {
                    int neighbour = graph[node][i];

                    if(!visited[neighbour]) {
                        q.push(neighbour);
                        visited[neighbour] = true;
                    }
                }
            }

            res += component_size * (n - component_size);
        }
    }

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