//Generated at 2020-09-19 21:20:55 UTC+8
//Created by Alphagocc
#include<bits/stdc++.h>
#ifdef USE_PBDS
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/priority_queue.hpp>
#endif
using namespace std;
#define FI __inline__ __attribute__((always_inline))
#define TN typename
#define TP template
#define TS *this
class IO{static const int bufSize=1<<18;char inBuf[bufSize],outBuf[bufSize];char*ip1=inBuf,*ip2=inBuf;int ok=1,op1=-1,op2=bufSize-1;
TP <TN T>FI void __RI(T&x){int ch=gc(),neg=1;x=0;for(;!(ch==EOF||isdigit(ch)||ch=='-');ch=gc());if(ch==EOF){ok=0;return;}if(ch=='-')neg=-1,ch=gc();for(;isdigit(ch);ch=gc())x=x*10+(ch-48)*neg;}
TP <TN T>FI void __RC(T&x){unsigned char ch;while(isspace(ch=gc()));if(ch==EOF){ok=0;return;}x=ch;}FI void __RS(string&x){char ch;x.clear();for(ch=gc();isspace(ch);ch=gc());if(ch==EOF){ok=0;return;}for(;!isspace(ch);ch=gc())x.push_back(ch);}
public:
FI int gc(){return ip1==ip2 &&(ip2 =(ip1=inBuf)+fread(inBuf,1,bufSize,stdin),ip1==ip2)?EOF:*ip1++;}
FI IO&R(char&x){__RC(x);return TS;}FI IO& R(unsigned char&x){__RC(x);return TS;}FI IO&R(string&x){__RS(x);return TS;}TP<TN T1,TN T2>FI IO&R(pair<T1,T2>&x){R(x.first),R(x.second);return TS;}TP<TN T>FI IO&R(vector<T>&x){for(auto &i:x)R(i);return TS;}
TP <TN T,TN...Args>FI IO&RA(T*a,int n){for(int i=0;i<n;++i)R(a[i]);return TS;}TP<TN T,TN...Args>FI IO&R(T&x,Args&...args){R(x),R(args...);return TS;}
TP <TN T,TN...Args>FI IO&RA(T*a,int n,Args...args){for(int i=0;i<n;++i)RA(a[i],args...);return TS;}TP<TN T>FI IO&R(T&x){static_assert(is_integral<T>::value,"Unsupported types");if(is_integral<T>::value)__RI(x);return TS;}
private:
char space=' ';TP<TN T>FI void __WI(T x){static char buf[64];static int len=-1;if(x>=0){do{buf[++len]=x%10+48,x/=10;}while(x);}else{pc('-');do{buf[++len]=-(x%10)+48,x/=10;}while(x);}while(len>=0){pc(buf[len]),--len;}}
public:
FI void pc(const char&x){if(op1==op2)flush();outBuf[++op1]=x;}
FI void flush(){fwrite(outBuf,1,op1+1,stdout),op1=-1;}FI IO&W(const char&x){pc(x);return TS;}FI IO&W(const char*x){while(*x!='\0')pc(*(x++));return TS;}FI IO&W(const string&x){W(x.c_str());return TS;}
TP<TN T>FI IO& W(const vector<T>&x){for(auto&i:x)WS(i);WL();return TS;}FI IO&WL(){W('\n');return TS;}TP<TN T1,TN T2>FI IO& W(const pair<T1,T2>&x){WS(x.first),W(x.second);return TS;}
TP<TN T>FI IO& WL(const T&x){W(x),W('\n');return TS;}FI IO&WS(){W(' ');return TS;}TP<TN T>FI IO& WS(const T&x){W(x),W(space);return TS;}
TP<TN T>FI IO& WA(T* a,int n){for(int i=0;i<n;i++)WS(a[i]);WL();return TS;}TP<TN T,TN...Args>FI IO& W(const T&x,const Args&...args){W(x),W(space),W(args...);return TS;}
TP<TN...Args>FI IO& WL(const Args&...args){W(args...),W('\n');return TS;}TP<TN T,TN...Args>FI IO& WA(T* a,int n,Args...args){for(int i=0;i<n;i++)WA(a[i],args...);return TS;}
TP<TN T>FI IO& W(const T&x){static_assert(is_integral<T>::value,"Unsupported types");if(is_integral<T>::value)__WI(x);return TS;}
TP<TN T>FI IO&operator>>(T&x){R(x);return TS;}TP<TN T>FI IO&operator<<(const T&x){W(x);return TS;}bool good(){return ok;}IO(){}~IO(){flush();}}io;
#undef TN 
#undef TP
#undef FI
#undef TS
#define REP(i,x,y)for(int i=x;i<y;i++)
#define ALL(x)x.begin(),x.end()
const int32_t INF=0x3f3f3f3f;
const int64_t INFL=0x3f3f3f3f3f3f3f3fLL;

template <typename DataT, typename ContainerT = vector<DataT>> struct SegTree
{
    //左闭右开
    int n;
    ContainerT node, lazy;
    SegTree() {}
    void build(ContainerT v)
    {
        int s = int(v.size());
        n = 1;
        while (n < s) { n <<= 1; }
        node.resize(2 * n - 1);
        lazy.resize(2 * n - 1, INF);
        for (int i = 0; i < s; i++) { node[i + n - 1] = v[i]; }
        for (int i = n - 2; i >= 0; i--) {
            node[i] = node[i * 2 + 1] + node[i * 2 + 2];
        }
    }
    inline void push(int k, int l, int r)
    {
        if (lazy[k] != INF) {
            node[k] = min(node[k], lazy[k]);
            if (r - l > 1) {
                lazy[(k << 1) + 1] = min(lazy[(k << 1) + 1], lazy[k]);
                lazy[(k << 1) + 2] = min(lazy[(k << 1) + 2], lazy[k]);
            }
            lazy[k] = INF;
        }
    }

    void update(int a, int b, DataT x, int k = 0, int l = 0, int r = -1)
    {
        if (r < 0) r = n;
        push(k, l, r);
        if (b <= l || r <= a) { return; }
        if (a <= l && r <= b) {
            lazy[k] = min(lazy[k], x);
            push(k, l, r);
        } else {
            update(a, b, x, (k << 1) + 1, l, ((l + r) >> 1));
            update(a, b, x, (k << 1) + 2, ((l + r) >> 1), r);
            node[k] = node[(k << 1) + 1] + node[(k << 1) + 2];
        }
    }

    DataT query(int a, int b, int k = 0, int l = 0, int r = -1)
    {
        if (r < 0) r = n;
        push(k, l, r);
        if (b <= l || r <= a) { return 0; }
        if (a <= l && r <= b) { return node[k]; }
        DataT vl = query(a, b, (k << 1) + 1, l, ((l + r) >> 1));
        DataT vr = query(a, b, (k << 1) + 2, ((l + r) >> 1), r);
        return vl + vr;
    }
};
int main()
{
    int n, q;
    io >> n >> q;
    vector<pair<int, int>> queries(q);
    io >> queries;
    int64_t ans = 1ll * (n - 2) * (n - 2);
    SegTree<int> a, b;
    a.build(vector<int>(n, n - 2));
    b = a;
    for (auto [op, x] : queries) {
        --x;
        if (op == 1) {
            ans -= a.query(x, x + 1);
            b.update(0, a.query(x, x + 1) + 1, x - 1);
        }
        if (op == 2) {
            ans -= b.query(x, x + 1);
            a.update(0, b.query(x, x + 1) + 1, x - 1);
        }
        // io.WL(ans);
    }
    io.WL(ans);
    return 0;
}

Measured memory_bytes: 13240