//#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define SZ(x) ((int)x.size())
#define uni(x) sort(all(x)),x.resize(unique(all(x))-x.begin());
#define GETPOS(c,x) (lower_bound(all(c),x)-c.begin())
#define lown1(x,val) low(in(x),val)-x
#define lowm1(x,val) low(im(x),val)-x
#define low1(x,nums,val) low(x+1,x+nums+1,val)-x
#define mst(x,val) memset((x),val,sizeof((x)))
#define ls rt<<1
#define rs rt<<1|1
#define lson rt<<1,l,M
#define rson rt<<1|1,M+1,r
#define PI acos(-1)
#define MM int M=(l+r)>>1;
#define fu(i,r,t) for(int i=r;i<=t;i++)
#define fd(i,r,t) for(int i=r;i>=t;i--)
#define fh(i,be,e) for(int i=head[be];~i;i=e[i].next)
#define fa(i,V) for(auto i:V)
#define far(i,V) for(auto &i:V)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define lcm(a,b) ((a)*(b))/__gcd(a,b)
#define cp(i,ans) printf("%.if",ans);
#define cpp(i,ans) cout<<setprecision(i)<<fixed<<ans<<endl;
#define ppb pop_back
#define ppf pop_front
#define pb push_back
#define pf push_front
#define pq priority_queue
#define lowbit(x) ((x)&(-x))
#define all(V) V.begin(),V.end()
#define ms multiset
#define mod(x) (((x)<0)?(x)%mo_num+mo_num:(x)%mo_num)
#define vc vector
#define vct vector<int>
#define out(i) cout<<(i)<<endl;
#define fi first
#define se second
#define fun(i) fu(i,1,n)
#define fut(i) fu(i,1,t)
#define fum(i) fu(i,1,m)
#define ld long double
#define umap unordered_map
#define Umap unordered_map<int,int>
#define P pair<int,int>
#define SET set<int>
#define mk make_tuple
#define eps 1e-6
//Remember cancel"#define endl '\n'" in interactive questions or use "<<flush"
#define endl '\n'
#define low lower_bound
#define upp upper_bound
#define yn(key) out(key?"YES":"NO")
//#define yn(key) out(key?"Yes":"No")
#define in(i) i+1,i+1+n
#define im(i) i+1,i+1+m
#define ik(i,k) i+1,i+1+k
#define bffs(i) __builtin_ffs(i)
#define bcount(i) __builtin_popcount(i)
#define bone(i) ((1<<i)-1)
#define db double
#define ll long long
#define got(container,num) get<num-1>(container)
#define int long long
#define print(a,n) fun(i)cout<<a[i]<<(i!=n?' ':endl);
#define outcase(x) cout<<"Case #"<<(++case_of_T)<<": "<<(x)<<endl;
#define ptcase(x) printf("Case #%d: %d\n",++case_of_T,x);
#define plcase(x) printf("Case #%lld: %lld\n",++case_of_T,x);
using namespace std;
//Remember to cancel the line below and declare INT=INT_MAX/2; when you want to change long to int
const int INF=LLONG_MAX/4,SINF=0x3f3f3f3f,Lim=1<<20,MINF=LLONG_MAX;
//const int INF=INT_MAX/4,SINF=0x3f;
// use C:printf("%.16f", x);  ->  printf("%.10f", x); can accelerate the program
const int dx[]={0,0,-1,1},dy[]={-1,1,0,0};//down up left right
const int maxn=2e5+10;
int mo_num=1e9+7;
//const int mo_num=998244353;
int n,m,t,a[maxn],b[maxn],ans,case_of_T;
int st[maxn<<3][3];
int tag[maxn<<3][3];
void pushup(int rt)
{
    tag[rt][1]=tag[rt][2]=-1;
}
void build(int rt,int l,int r)
{
    if(l==r)
    {
        st[rt][1]=st[rt][2]=n;
        tag[rt][1]=tag[rt][2]=-1;
        return;
    }
    MM;
    build(lson),build(rson);
    pushup(rt);
}
void pushdown(int rt,int kind)
{
    if(~tag[rt][kind])
    {
        tag[ls][kind]=~tag[ls][kind]?min(tag[rt][kind],tag[ls][kind]):tag[rt][kind];
        tag[rs][kind]=~tag[rs][kind]?min(tag[rt][kind],tag[rs][kind]):tag[rt][kind];
        st[ls][kind]=min(st[ls][kind],tag[rt][kind]);
        st[rs][kind]=min(st[rs][kind],tag[rt][kind]);
        tag[rt][kind]=-1;
    }
}
void update(int rt,int l,int r,int L,int R,int val,int kind)
{
    pushdown(rt,kind);
    if(l>=L && r<=R)
    {
        st[rt][kind]=min(st[rt][kind],val);
        tag[rt][kind]=~tag[rt][kind]?min(tag[rt][kind],val):val;
        return;
    }
    MM;
    if(M>=L)update(lson,L,R,val,kind);
    if(M<R)update(rson,L,R,val,kind);
}
int query(int rt,int l,int r,int pos,int kind)
{
    pushdown(rt,kind);
    if(l==r)return st[rt][kind];
    MM;
    if(M>=pos)return query(lson,pos,kind);
    else return query(rson,pos,kind);
}
void deal(int z,int y)
{
    int mi=n;
    fum(i)
    {
        if(a[i]==z)
        {
            int val=query(1,1,n,b[i],z)-2;
            ans-=val>=0?val:0;
            mi=min(mi,b[i]);
        }else{
            update(1,1,n,1,mi-1,b[i],z);
        }
    }
}
void solve()
{
    cin>>n>>m;
    build(1,1,n);
    fum(i)
    {
        cin>>a[i]>>b[i];
    }
    ans=(n-2)*(n-2);
    deal(1,2);
    deal(2,1);
    out(ans)
    return ;
}
main()
{
    IOS
    int T=1;
    //cin>>T;
    while(T--)solve();
    return 0;
}


Measured memory_bytes: 55892