#include <iostream>
#include <algorithm>
#define MAXN 1000010
using namespace std;
int n, k, x[MAXN], y[MAXN], q, p; long long ans;

int main() {
	cin >> n >> k;
    for (int i = 1; i <= k; i++) cin >> x[i] >> y[i];
    sort(x+1, x+k+1);
    sort(y+1, y+k+1);
    for (int i = 1; i <= k; i++) {
        if (x[i] != x[i+1]) q++;
        if (y[i] != y[i+1]) p++;
    }
    ans = n*n - (n-q)*(n-p);
    cout << ans << endl;
	return 0;
}