#line 2 "cpplib/util/template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#include<bits/stdc++.h>
using namespace std;
struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define endl ('\n')
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}
template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}
template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}
#define rep(i,...) for(auto i:range(__VA_ARGS__)) 
#define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}
inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}
inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}
template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}
#define all(n) begin(n),end(n)
template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}
template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
#line 5 "cpplib/graph_tree/graph_template.hpp"
/**
 * @brief グラフテンプレート
 */

using graph=std::vector<std::vector<int>>;
template<typename T>
using graph_w=std::vector<std::vector<std::pair<int,T>>>;

graph load_graph(int n,int m){
    graph g(n);
    for(int i=0;i<m;++i){
        int s,t;
        std::cin>>s>>t;
        --s;--t;
        g[s].push_back(t);
        g[t].push_back(s);
    }
    return g;
}
graph load_digraph(int n,int m){
    graph g(n);
    for(int i=0;i<m;++i){
        int s,t;
        std::cin>>s>>t;
        --s;--t;
        g[s].push_back(t);
    }
    return g;
}
graph load_graph0(int n,int m){
    graph g(n);
    for(int i=0;i<m;++i){
        int s,t;
        std::cin>>s>>t;
        g[s].push_back(t);
        g[t].push_back(s);
    }
    return g;
}
graph load_digraph0(int n,int m){
    graph g(n);
    for(int i=0;i<m;++i){
        int s,t;
        std::cin>>s>>t;
        g[s].push_back(t);
    }
    return g;
}
graph load_tree(int n){
    graph g(n);
    for(int i=0;i<n-1;++i){
        int s,t;
        std::cin>>s>>t;
        --s;--t;
        g[s].push_back(t);
        g[t].push_back(s);
    }
    return g;
}
graph load_tree0(int n){
    graph g(n);
    for(int i=0;i<n-1;++i){
        int s,t;
        std::cin>>s>>t;
        g[s].push_back(t);
        g[t].push_back(s);
    }
    return g;
}
graph load_treep(int n){
    graph g(n);
    for(int i=0;i<n-1;++i){
        int t;
        std::cin>>t;
        g[i+1].push_back(t);
        g[t].push_back(i+1);
    }
    return g;
}

template<typename T>
graph_w<T> load_graph_weight(int n,int m){
    graph_w<T> g(n);
    for(int i=0;i<m;++i){
        int s,t;
        T u;
        std::cin>>s>>t>>u;
        --s;--t;
        g[s].emplace_back(t,u);
        g[t].emplace_back(s,u);
    }
    return g;
}
template<typename T>
graph_w<T> load_digraph_weight(int n,int m){
    graph_w<T> g(n);
    for(int i=0;i<m;++i){
        int s,t;
        T u;
        std::cin>>s>>t>>u;
        --s;--t;
        g[s].emplace_back(t,u);
    }
    return g;
}
template<typename T>
graph_w<T> load_graph0_weight(int n,int m){
    graph_w<T> g(n);
    for(int i=0;i<m;++i){
        int s,t;
        T u;
        std::cin>>s>>t>>u;
        g[s].emplace_back(t,u);
        g[t].emplace_back(s,u);
    }
    return g;
}
template<typename T>
graph_w<T> load_digraph0_weight(int n,int m){
    graph_w<T> g(n);
    for(int i=0;i<m;++i){
        int s,t;
        T u;
        std::cin>>s>>t>>u;
        g[s].emplace_back(t,u);
    }
    return g;
}
template<typename T>
graph_w<T> load_tree_weight(int n){
    graph_w<T> g(n);
    for(int i=0;i<n-1;++i){
        int s,t;
        T u;
        std::cin>>s>>t>>u;
        --s;--t;
        g[s].emplace_back(t,u);
        g[t].emplace_back(s,u);
    }
    return g;
}
template<typename T>
graph_w<T> load_tree0_weight(int n){
    graph_w<T> g(n);
    for(int i=0;i<n-1;++i){
        int s,t;
        T u;
        std::cin>>s>>t>>u;
        g[s].emplace_back(t,u);
        g[t].emplace_back(s,u);
    }
    return g;
}
template<typename T>
graph_w<T> load_treep_weight(int n){
    graph_w<T> g(n);
    for(int i=0;i<n-1;++i){
        int t;
        T u;
        std::cin>>t>>u;
        g[i+1].emplace_back(t,u);
        g[t].emplace_back(i+1,u);
    }
    return g;
}
#line 3 "cpplib/alga/maybe.hpp"

/**
 * @brief Maybe
 * @see https://ja.wikipedia.org/wiki/%E3%83%A2%E3%83%8A%E3%83%89_(%E3%83%97%E3%83%AD%E3%82%B0%E3%83%A9%E3%83%9F%E3%83%B3%E3%82%B0)#Maybe%E3%83%A2%E3%83%8A%E3%83%89
 */

template<typename T>
struct maybe{
    bool _is_none;
    T val;
    maybe():_is_none(true){}
    maybe(T val):_is_none(false),val(val){}
    T unwrap()const{
        assert(!_is_none);
        return val;
    }
    T unwrap_or(T e)const{
        return _is_none?e:val;
    }
    bool is_none()const{return _is_none;}
    bool is_some()const{return !_is_none;}
};

template<typename T,typename F>
auto expand(F op){
    return [&op](const maybe<T>& s,const maybe<T>& t){
        if(s.is_none())return t;
        if(t.is_none())return s;
        return maybe<T>(op(s.unwrap(),t.unwrap()));
    };
}
#line 3 "cpplib/segment_tree/dual_segment_tree.hpp"

/**
 * @brief 双対セグメント木
 */

template<typename T,typename F>
class dual_segment_tree{
	struct node;
	using np=node*;
	struct node{
		maybe<T> val;
		np ch[2]={nullptr,nullptr};
		node(maybe<T> val=maybe<T>()):val(val){}
	};
	np root=nullptr;
	int n=1,sz;
    F op;
	public:
	dual_segment_tree(int sz,F op=F()):sz(sz),op(op){while(n<sz)n<<=1;}
	inline void update(int l,int r,T x){update(l,r,x,0,n,root);}
	inline maybe<T> get(int x){return get(x,0,n,root);}
	private:
	void eval(np& t){
        auto f=expand<T,F>(op);
		if(t->val.is_none())return;
		if(!t->ch[0])t->ch[0]=new node();
		if(!t->ch[1])t->ch[1]=new node();
		t->ch[0]->val=f(t->ch[0]->val,t->val);
		t->ch[1]->val=f(t->ch[1]->val,t->val);
		t->val=maybe<T>();
	}
	void update(int a,int b,T x,int l,int r,np& t){
        auto f=expand<T,F>(op);
        if(!t)t=new node();
		if(r-l>1)eval(t);
		if(r<=a||b<=l)return;
		else if(a<=l&&r<=b)t->val=f(t->val,x);
	    else if(r-l>1){
			update(a,b,x,l,(l+r)/2,t->ch[0]);
			update(a,b,x,(l+r)/2,r,t->ch[1]);
		}
	}
	maybe<T> get(int x,int l,int r,np& t){
        auto f=expand<T,F>(op);
        if(!t)t=new node();
		if(r-l>1)eval(t);
		if(x<l||r<=x)return maybe<T>();
        else if(r-l==1){
            return t->val;
        }
		else return f(get(x,l,(l+r)/2,t->ch[0]),get(x,(l+r)/2,r,t->ch[1]));
	}
};
#line 3 "cpplib/functional/MIN.hpp"

/**
 * @brief 最小値
 */

template<typename T>
struct MIN{
    T operator()(const T& s,const T& t){
        return std::min(s,t);
    }
};
#line 4 "code.cpp"

int main(){
    lint n,q;
    cin>>n>>q;
    dual_segment_tree<lint,MIN<lint>>hs(n-2),ws(n-2);
    lint ans=(n-2)*(n-2);
    while(q--){
        lint c,x;
        cin>>c>>x;
        x-=2;
        if(c==1){
            lint k=ws.get(x).unwrap_or(n-2);
            ans-=k;
            hs.update(0,k,x);
        }else{
            lint k=hs.get(x).unwrap_or(n-2);
            ans-=k;
            ws.update(0,k,x);
        }
    }
    cout<<ans<<endl;
}


Measured memory_bytes: 39432