#include<bits/stdc++.h> 
using namespace std;
long long n,k,mx,my,x[1000005],y[1000005];
int main()
{
x[0]=-1;
y[0]=-1;
    cin>>n>>k;
    for(int i=1;i<=k;i++)
{
    //scanf("&d&d",&x[i],&y[i]);
cin>>x[i]>>y[i];
}
    sort(x+1,x+1+k);
    sort(y+1,y+1+k);
    for(int i=1;i<=k;i++)
    {
        if(x[i]!=x[i-1])my++;
        if(y[i]!=y[i-1])mx++;
    }
    long long ma=(mx+my)*n-mx*my;
cout<<ma;
    return 0;
}