// Slower C++ solution:
#include <bits/stdc++.h>



// #include <atcoder/all>



using namespace std;

// using namespace atcoder;

 

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;

#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;

#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}

typedef long long ll;

// #define int ll

 

#define vi vector<int>

#define vl vector<ll>

#define vii vector< vector<int> >

#define vll vector< vector<ll> >

#define vs vector<string>

#define pii pair<int,int>

#define pis pair<int,string>

#define psi pair<string,int>

#define pll pair<ll,ll>

template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }

template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }

template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }

#define X first

#define Y second

#define rep(i,n) for(int i=0;i<(int)(n);i++)

#define rep1(i,n) for(int i=1;i<=(int)(n);i++)

#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)

#define rrep1(i,n) for(int i=(int)(n);i>0;i--)

#define REP(i,a,b) for(int i=a;i<b;i++)

#define in(x, a, b) (a <= x && x < b)

#define all(c) c.begin(),c.end()

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }

template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }

#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());

const ll inf = 1000000001;

const ll INF = (ll)1e18 + 1;

const long double pi = 3.1415926535897932384626433832795028841971L;

#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;

// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };

vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};

// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };

#define fio() cin.tie(0); ios::sync_with_stdio(false);

// const ll MOD = 1000000007;

const ll MOD = 998244353;

// #define mp make_pair

//#define endl '\n'







template <typename T1, typename T2>

class LazySegmentTree {

public:

  using F = function<T1(T1&, T1&)>; // query_func

  using G = function<T2(T2&, T2&)>; // update_func

  using H = function<T1(T1&, T2&, int, int)>; // lazy to node (node, lazy, left, right)

  int n;

  vector<T1> node;

  vector<T2> lazy;

  T1 e1;

  T2 e2;

  F query_func;

  G update_func;

  H eval_func;



  LazySegmentTree(vector<T1> a, F query_func, G update_func, H eval_func, T1 e1, T2 e2)

    :query_func(query_func), update_func(update_func), eval_func(eval_func), e1(e1), e2(e2)

  {

    int _n = a.size();

    n = 1; while (n < _n) n *= 2;

    node.resize(2 * n - 1, e1);

    lazy.resize(2 * n - 1, e2);

    for (int i = 0; i < _n; i++) node[i + n - 1] = a[i];

    for (int i = n - 2; i >= 0; i--) {

      node[i] = query_func(node[i * 2 + 1], node[i * 2 + 2]);

    }

  }



  // k�Ԗڂ̃m�[�h�ɂ��Ēx���]�����s��

  inline void eval(int k, int l, int r) {

    if (lazy[k] != e2) { // Change

      node[k] = eval_func(node[k], lazy[k], l, r);

      if (r - l > 1) {

        lazy[2 * k + 1] = update_func(lazy[2*k + 1], lazy[k]);

        lazy[2 * k + 2] = update_func(lazy[2*k + 2], lazy[k]);

      }

      lazy[k] = e2; // Change

    }

  }



  // [a, b)��x�ɂ���

  void update(int a, int b, T2 x, int k, int l, int r) {

    // k �Ԗڂ̃m�[�h�ɑ΂��Ēx���]�����s��

    eval(k, l, r);

    if (b <= l || r <= a) return;

    if (a <= l && r <= b) {

      lazy[k] = update_func(lazy[k], x);

      eval(k, l, r);

    }

    else {

      update(a, b, x, 2 * k + 1, l, (l + r) / 2);

      update(a, b, x, 2 * k + 2, (l + r) / 2, r);

      node[k] = query_func(node[2 * k + 1], node[2 * k + 2]);

    }

  }



  T1 query(int a, int b, int k, int l, int r) {

    eval(k, l, r);

    if (b <= l || r <= a) return e1;

    if (a <= l && r <= b) return node[k];

    T1 resl = query(a, b, 2 * k + 1, l, (l + r) / 2);

    T1 resr = query(a, b, 2 * k + 2, (l + r) / 2, r);

    return query_func(resl, resr);

  }

};



ll f(ll a, ll b) {return a + b;}

ll g(ll a, ll b) {return b;}

ll h(ll a, ll b, int l, int r) {return b * (r - l);}





signed main() {

    fio();



    int n, q;

    cin >> n >> q;

    vi tate(n - 1, n - 2), yoko(n - 1, n - 2);

    LazySegmentTree<int, int> tt(tate, f, g, h, 0, inf), yy(yoko, f, g, h, 0, inf);

    int h = n - 1, w = n - 1;

    ll ans = (ll)(n - 2) * (n - 2);

    while (q--) {

        // DEBUG(ans);

        int t, x;

        cin >> t >> x;

        x--;

        if (t == 1) {

            if (x >= w) {

                ans -= tt.query(x, x + 1, 0, 0, tt.n);

            }

            else {

                ans -= h - 1;

                w = x;

                yy.update(0, h, w - 1, 0, 0, yy.n);

            }

        }

        else {

            if (x >= h) {

                ans -= yy.query(x, x + 1, 0, 0, yy.n);

            }

            else {

                ans -= w - 1;

                h = x;

                tt.update(0, w, h - 1, 0, 0, tt.n);

            }

        }

        // DEBUG(ans);

        // rep (i, n - 1) {

        //     cout << tt.query(i, i + 1, 0, 0, tt.n) << " ";

        // }

        // cout << endl;

        // rep (i, n - 1) {

        //     cout << yy.query(i, i + 1, 0, 0, yy.n) << " ";

        // }

        // cout << endl;

    }

    cout << ans << endl;

}

// Faster C++ solution for the same problem (measured speedup: 1.5784599660758605x):
#include <bits/stdc++.h>



// #include <atcoder/all>



using namespace std;

// using namespace atcoder;

 

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;

#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;

#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}

typedef long long ll;

// #define int ll

 

#define vi vector<int>

#define vl vector<ll>

#define vii vector< vector<int> >

#define vll vector< vector<ll> >

#define vs vector<string>

#define pii pair<int,int>

#define pis pair<int,string>

#define psi pair<string,int>

#define pll pair<ll,ll>

template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }

template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }

template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }

#define X first

#define Y second

#define rep(i,n) for(int i=0;i<(int)(n);i++)

#define rep1(i,n) for(int i=1;i<=(int)(n);i++)

#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)

#define rrep1(i,n) for(int i=(int)(n);i>0;i--)

#define REP(i,a,b) for(int i=a;i<b;i++)

#define in(x, a, b) (a <= x && x < b)

#define all(c) c.begin(),c.end()

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }

template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }

#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());

const ll inf = 1000000001;

const ll INF = (ll)1e18 + 1;

const long double pi = 3.1415926535897932384626433832795028841971L;

#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;

// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };

vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};

// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };

#define fio() cin.tie(0); ios::sync_with_stdio(false);

// const ll MOD = 1000000007;

const ll MOD = 998244353;

// #define mp make_pair

//#define endl '\n'







template <typename T1, typename T2>

class LazySegmentTree {

public:

  using F = function<T1(T1&, T1&)>; // query_func

  using G = function<T2(T2&, T2&)>; // update_func

  using H = function<T1(T1&, T2&, int, int)>; // lazy to node (node, lazy, left, right)

  int n;

  vector<T1> node;

  vector<T2> lazy;

  T1 e1;

  T2 e2;

  F query_func;

  G update_func;

  H eval_func;



  LazySegmentTree(vector<T1> a, F query_func, G update_func, H eval_func, T1 e1, T2 e2)

    :query_func(query_func), update_func(update_func), eval_func(eval_func), e1(e1), e2(e2)

  {

    int _n = a.size();

    n = 1; while (n < _n) n *= 2;

    node.resize(2 * n - 1, e1);

    lazy.resize(2 * n - 1, e2);

    for (int i = 0; i < _n; i++) node[i + n - 1] = a[i];

    for (int i = n - 2; i >= 0; i--) {

      node[i] = query_func(node[i * 2 + 1], node[i * 2 + 2]);

    }

  }



  // k�Ԗڂ̃m�[�h�ɂ��Ēx���]�����s��

  inline void eval(int k, int l, int r) {

    if (lazy[k] != e2) { // Change

      node[k] = eval_func(node[k], lazy[k], l, r);

      if (r - l > 1) {

        lazy[2 * k + 1] = update_func(lazy[2*k + 1], lazy[k]);

        lazy[2 * k + 2] = update_func(lazy[2*k + 2], lazy[k]);

      }

      lazy[k] = e2; // Change

    }

  }



  // [a, b)��x�ɂ���

  void update(int a, int b, T2 x, int k, int l, int r) {

    // k �Ԗڂ̃m�[�h�ɑ΂��Ēx���]�����s��

    eval(k, l, r);

    if (b <= l || r <= a) return;

    if (a <= l && r <= b) {

      lazy[k] = update_func(lazy[k], x);

      eval(k, l, r);

    }

    else {

      update(a, b, x, 2 * k + 1, l, (l + r) / 2);

      update(a, b, x, 2 * k + 2, (l + r) / 2, r);

      node[k] = query_func(node[2 * k + 1], node[2 * k + 2]);

    }

  }



  T1 query(int a, int b, int k, int l, int r) {

    eval(k, l, r);

    if (b <= l || r <= a) return e1;

    if (a <= l && r <= b) return node[k];

    T1 resl = query(a, b, 2 * k + 1, l, (l + r) / 2);

    T1 resr = query(a, b, 2 * k + 2, (l + r) / 2, r);

    return query_func(resl, resr);

  }

};



ll f(ll a, ll b) {return a + b;}

ll g(ll a, ll b) {return b;}

ll h(ll a, ll b, int l, int r) {return b * (r - l);}





signed main() {

    fio();



    int n, q;

    cin >> n >> q;

    vi tate(n - 1, n - 2), yoko(n - 1, n - 2);

    // LazySegmentTree<int, int> tt(tate, f, g, h, 0, inf), yy(yoko, f, g, h, 0, inf);

    int h = n - 1, w = n - 1;

    int yyy = n - 2, ttt = n - 2;

    ll ans = (ll)(n - 2) * (n - 2);

    while (q--) {

        // DEBUG(ans);

        int t, x;

        cin >> t >> x;

        x--;

        if (t == 1) {

            if (x >= w) {

                // ans -= tt.query(x, x + 1, 0, 0, tt.n);

                ans -= tate[x];

            }

            else {

                ans -= h - 1;

                for (int j = x; j < w; j++) {

                    tate[j] = h - 1;

                }

                w = x;

                // yy.update(0, h, w - 1, 0, 0, yy.n);

                yyy = w - 1;

            }

        }

        else {

            if (x >= h) {

                // ans -= yy.query(x, x + 1, 0, 0, yy.n);

                ans -= yoko[x];

            }

            else {

                ans -= w - 1;

                for (int i = x; i < h; i++) {

                    yoko[i] = w - 1;

                }

                h = x;

                // tt.update(0, w, h - 1, 0, 0, tt.n);

                ttt = h - 1;

            }

        }

        // DEBUG(ans);

        // rep (i, n - 1) {

        //     cout << tt.query(i, i + 1, 0, 0, tt.n) << " ";

        // }

        // cout << endl;

        // rep (i, n - 1) {

        //     cout << yy.query(i, i + 1, 0, 0, yy.n) << " ";

        // }

        // cout << endl;

    }

    cout << ans << endl;

}