#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

#define  MAXN 1001000

using namespace std;

long long n,k,ans;

long long r[MAXN],c[MAXN];

int main(){

    scanf("%lld%lld",&n,&k);

    for(int i=;i<=k;i++)

        scanf("%lld%lld",&r[i],&c[i]);

    sort(r+,r++k);

    sort(c+,c++k);

    long long n1=unique(r+,r++k)-r-;

    long long n2=unique(c+,c++k)-c-;

    ans=n*n-(n-n1)*(n-n2);

    printf("%lld",ans);

}