#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#define DF(x) x.erase(x.begin())
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define RSORT(x) sort(x.rbegin(), x.rend())
#define REVERSE(x) reverse(ALL(x))
#define MAX(x) *max_element(ALL(x))
#define MAXI(x) max_element(ALL(x)) - x.begin()
#define SUM(x) accumulate(ALL(x), 0ll)
#define COUNT(x, y) count(ALL(x), y);
#define ANS cout << ans << "\n"
#define YES cout << "YES\n";
#define NO cout << "NO\n";
#define Yes cout << "Yes\n";
#define No cout << "No\n";
#define YN YES else NO
#define yn Yes else No
#define init() \
  cin.tie(0);  \
  ios::sync_with_stdio(false)
#define LINE cerr << "[debug] line: " << __LINE__ << "\n";
#define debug(x) cerr << "[debug] " << #x << ": " << x << "\n";
#define debugV(v)                       \
  cerr << "[debugV] " << #v << ":";     \
  rep(z, v.size()) cerr << " " << v[z]; \
  cerr << "\n";
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using mll = map<ll, ll>;
using qll = queue<ll>;
using P = pair<ll, ll>;
using vp = vector<P>;
using vs = vector<string>;

template <typename T>
inline istream& operator>>(istream& i, vector<T>& v) {
  rep(j, v.size()) i >> v[j];
  return i;
}

template <typename T1, typename T2>
inline istream& operator>>(istream& i, pair<T1, T2>& v) {
  return i >> v.first >> v.second;
}

constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr ld PI = 3.141592653589793238462643383279;
ll get_digit(ll x) {
  return to_string(x).size();
}

ll gcd(ll x, ll y) {
  return y ? gcd(y, x % y) : x;
}

ll lcm(ll a, ll b) {
  return a / gcd(a, b) * b;
}

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 (b < a) {
    a = b;
    return 1;
  }
  return 0;
}

#define SEGLEN (1 << 18)
struct SegmentTree {
  vll seg;

  void initialize(ll v) {
    seg.resize(SEGLEN * 2);
    rep(i, SEGLEN * 2) seg[i] = v;
  }

  void update(ll l, ll r, ll v) {
    l += SEGLEN;
    r += SEGLEN;
    while (l < r) {
      if (l % 2 == 1) {
        chmin(seg[l], v);
        ++l;
      }
      l /= 2;
      if (r % 2 == 1) {
        chmin(seg[r - 1], v);
        --r;
      }
      r /= 2;
    }
  }

  ll get(ll i) {
    i += SEGLEN;
    ll res = seg[i];
    seg[i] = 0;
    while (true) {
      i /= 2;
      if (i == 0) break;
      chmin(res, seg[i]);
    }
    return res;
  }
};

signed main() {
  init();
  ll N, Q;
  cin >> N >> Q;
  SegmentTree seg1;
  SegmentTree seg2;
  seg1.initialize(N - 2);
  seg2.initialize(N - 2);

  ll ans = (N - 2) * (N - 2);
  rep(i, Q) {
    ll c, x;
    cin >> c >> x;
    x--;
    if (c == 1) {
      ll count = seg1.get(x);
      ans -= count;
      seg2.update(0, count + 1, x - 1);
    } else {
      ll count = seg2.get(x);
      ans -= count;
      seg1.update(0, count + 1, x - 1);
    }
  }
  ANS;
  return 0;
}

Measured memory_bytes: 11392