Problem: 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?

Constraints

* 3 \leq N \leq 2\times 10^5
* 0 \leq Q \leq \min(2N-4,2\times 10^5)
* 2 \leq x \leq N-1
* Queries are pairwise distinct.

Input

Input is given from Standard Input in the following format:


N Q
Query_1
\vdots
Query_Q


Output

Print how many black stones there are on the grid after processing all Q queries.

Examples

Input

5 5
1 3
2 3
1 4
2 2
1 2


Output

1


Input

200000 0


Output

39999200004


Input

176527 15
1 81279
2 22308
2 133061
1 80744
2 44603
1 170938
2 139754
2 15220
1 172794
1 159290
2 156968
1 56426
2 77429
1 97459
2 71282


Output

31159505795

Solution (in PYTHON3):

Solution:
import sys
input = sys.stdin.readline
n, q = map(int,input().split())
C = [list(map(int,input().split())) for i in range(q)]

# ACLに伴い0-indexedに直した
class Bit:  # Fenwick Tree と同じ
    def __init__(self, n):
        self.size = n
        self.tree = [0] * (n + 1)
  
    def sum(self, l, r):  # [l,r)の合計を求める
        # 内部的には[l+1,r+1)の合計つまり(rまでの合計-lまでの合計)
        s = 0
        while r > 0:
            s += self.tree[r]
            r -= r & -r
        while l > 0:
            s -= self.tree[l]
            l -= l & -l
        return s
  
    def add(self, i, x):  # i番目にxを足す
        i += 1
        while i <= self.size:
            self.tree[i] += x
            i += i & -i

# Bitの内部状態をindex順に出力
def print_bit(B):
    n = B.size
    ANS = []
    for i in range(n):
        ANS.append(B.sum(i, i+1))
    print(*ANS)

A = Bit(n)
B = Bit(n)
A.add(0, n-2)
B.add(0, n-2)
AC = [0] * n
BC = [0] * n
ans = 0
minac = n-1
minbc = n-1

# print("A",[A.sum(0,i+1) for i in range(n)])
# print("B",[B.sum(0,i+1) for i in range(n)])
for i in range(q):
    c1 = C[i][1]-1
    if C[i][0] == 1:
        BC[c1] = 1
        if minbc > c1:
            # print(1,c1)
            minbc=c1
            # print("A",[A.sum(0,i+1) for i in range(n)])
            oku = B.sum(0,c1+1)
            # print("oku",oku)
            a0 = A.sum(0,1)
            aoku = A.sum(0, oku+1)
            A.add(0, -a0+c1-1)
            A.add(oku+1, aoku-A.sum(0,1))
            # print("A",[A.sum(0,i+1) for i in range(n)])
    elif C[i][0] == 2:
        AC[c1] = 1
        if minac > c1:
            # print(2,c1)
            minac = c1
            # print("B",[B.sum(0,i+1) for i in range(n)])
            oku = A.sum(0,c1+1)
            a0 = B.sum(0,1)
            aoku = B.sum(0, oku+1)
            B.add(0, -a0+c1-1)
            B.add(oku+1, aoku-B.sum(0,1))

            # print("B",[B.sum(0,i+1) for i in range(n)])


# print("FINAL")
# print("A",[A.sum(0,i+1) for i in range(n)])
# print("B",[B.sum(0,i+1) for i in range(n)])
# print("AC",AC)
# print("BC",BC)
for i in range(1, n-1):
    if AC[i] == 0:
        # print(i,A.sum(i,i+1))
        ans += A.sum(0,i+1)
for i in range(1, n-1):
    if BC[i] == 0:
        ans += B.sum(0,i+1)

for i in range(1, minac):
    ans -= A.sum(0,i+1)

print(ans)