output_description: Print how many black stones there are on the grid after processing all Q
  queries.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N Q
      Query_1
      \vdots
      Query_Q
attempt: from bisect import bisect_left as bl
  
  N, Q = map(int, input().split())
  ans = 0
  q1 = []
  q2 = []
  query = []
  for _ in range(Q):
      n, p = map(int, input().split())
      query.append((n, p))
      if n == 1:
          q1.append(p)
      else:
          q2.append(p)
  q1.sort()
  q2.sort()
  board = [N - 2, N - 2]
  count1 = len(q1)
  count2 = len(q2)
  for n, p in query:
      if n == 1:
          if p > board[1] + 1:
              continue
          index = bl(q1, p)
          ans += board[0] * (count1 - index)
          board[1] = p - 2
          count1 = index
      else:
          if p > board[0] + 1:
              continue
          index = bl(q2, p)
          ans += board[1] * (count2 - index)
          board[0] = p - 2
          count2 = index
  print((N - 2) ** 2 - ans)
  
problem_description: Statement
  
  There is a grid with N rows and N columns of squares. Let (i, j) be the square
  at the i-th row from the top and the j-th column from the left.
  
  Each of the central (N-2) \times (N-2) squares in the grid has a black stone
  on it. Each of the 2N - 1 squares on the bottom side and the right side has a
  white stone on it.
  
  Q queries are given. We ask you to process them in order. There are two kinds
  of queries. Their input format and description are as follows:
  
    * `1 x`: Place a white stone on (1, x). After that, for each black stone between (1, x) and the first white stone you hit if you go down from (1, x), replace it with a white stone.
    * `2 x`: Place a white stone on (x, 1). After that, for each black stone between (x, 1) and the first white stone you hit if you go right from (x, 1), replace it with a white stone.
  
  How many black stones are there on the grid after processing all Q queries?
samples: [{"input": "5 5\n    1 3\n    2 3\n    1 4\n    2 2\n    1 2", "output": "1\n    \n\nAfter each query, the grid changes in the following way:\n\n![Figure](https://img.atcoder.jp/ghi/31ba2cd6b3155b137f0e007299225028.png)\n\n* * *"}, {"input": "200000 0", "output": "39999200004\n    \n\n* * *"}, {"input": "176527 15\n    1 81279\n    2 22308\n    2 133061\n    1 80744\n    2 44603\n    1 170938\n    2 139754\n    2 15220\n    1 172794\n    1 159290\n    2 156968\n    1 56426\n    2 77429\n    1 97459\n    2 71282", "output": "31159505795"}]