class LazySegmentTree:

    """

    init(init_val, ide_ele): 配列init_valで初期化 O(N)

    update(l, r, x): 区間[l, r)をxに更新 O(logN)

    query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)

    """

    def __init__(self, init_val, segfunc, ide_ele):

        """

        init_val: 配列の初期値

        segfunc: 区間にしたい操作

        ide_ele: 単位元

        num: n以上の最小の2のべき乗

        data: 値配列(1-index)

        lazy: 遅延配列(1-index)

        """

        n = len(init_val)

        self.segfunc = segfunc

        self.ide_ele = ide_ele

        self.num = 1 << (n - 1).bit_length()

        self.data = [ide_ele] * 2 * self.num

        self.lazy = [None] * 2 * self.num

        # 配列の値を葉にセット

        for i in range(n):

            self.data[self.num + i] = init_val[i]

        # 構築していく

        for i in range(self.num - 1, 0, -1):

            self.data[i] = self.segfunc(self.data[2 * i], self.data[2 * i + 1])



    def gindex(self, l, r):

            """

            伝搬する対象の区間を求める

            lm: 伝搬する必要のある最大の左閉区間

            rm: 伝搬する必要のある最大の右開区間

            """

            l += self.num

            r += self.num

            lm = l >> (l & -l).bit_length()

            rm = r >> (r & -r).bit_length()



            while r > l:

                if l <= lm:

                    yield l

                if r <= rm:

                    yield r

                r >>= 1

                l >>= 1

            while l:

                yield l

                l >>= 1



    def propagates(self, *ids):

        """

        遅延伝搬処理

        ids: 伝搬する対象の区間

        """

        for i in reversed(ids):

            v = self.lazy[i]

            if v is None:

                continue

            self.lazy[2 * i] = v

            self.lazy[2 * i + 1] = v

            self.data[2 * i] = v

            self.data[2 * i + 1] = v

            self.lazy[i] = None



    def update(self, l, r, x):

        """

        区間[l, r)の値をxに更新

        l, r: index(0-index)

        x: update value

        """

        *ids, = self.gindex(l, r)

        self.propagates(*ids)

        l += self.num

        r += self.num

        while l < r:

            if l & 1:

                self.lazy[l] = x

                self.data[l] = x

                l += 1

            if r & 1:

                self.lazy[r - 1] = x

                self.data[r - 1] = x

            r >>= 1

            l >>= 1

        for i in ids:

            self.data[i] = self.segfunc(self.data[2 * i], self.data[2 * i + 1])





    def query(self, l, r):

        """

        [l, r)のsegfuncしたものを得る

        l: index(0-index)

        r: index(0-index)

        """

        *ids, = self.gindex(l, r)

        self.propagates(*ids)



        res = self.ide_ele



        l += self.num

        r += self.num

        while l < r:

            if l & 1:

                res = self.segfunc(res, self.data[l])

                l += 1

            if r & 1:

                res = self.segfunc(res, self.data[r - 1])

            l >>= 1

            r >>= 1

        return res



def segfunc(x, y):

    return min(x, y)



ide_ele =  10**9





N, Q = list(map(int, input().split()))

ans = (N-2)*(N-2)

R = [N]*(N+1)

W = [N]*(N+1)

seg_r = LazySegmentTree(R, segfunc, ide_ele)

seg_w = LazySegmentTree(W, segfunc, ide_ele)

for i in range(Q):

    a, b = list(map(int, input().split()))

    if a == 1:

        t = seg_r.query(b, b+1)

        ans -= max(0, t - 2)

        if b <= seg_w.query(1, 2):

            seg_w.update(1, t+1, b)

        seg_r.update(b, b+1, 0)

    else:

        t = seg_w.query(b, b+1)

        ans -= max(0, t - 2)

        if b <= seg_r.query(1, 2):

            seg_r.update(1, t+1, b)

        seg_w.update(b, b+1, 0)

print(ans)
class LazySegmentTree:



    def __init__(self, init_val, segfunc, ide_ele):

        n = len(init_val)

        self.segfunc = segfunc

        self.ide_ele = ide_ele

        self.num = 1 << (n - 1).bit_length()

        self.data = [ide_ele] * 2 * self.num

        self.lazy = [None] * 2 * self.num



        for i in range(n):

            self.data[self.num + i] = init_val[i]



        for i in range(self.num - 1, 0, -1):

            self.data[i] = self.segfunc(self.data[2 * i], self.data[2 * i + 1])



    def gindex(self, l, r):

            l += self.num

            r += self.num

            lm = l >> (l & -l).bit_length()

            rm = r >> (r & -r).bit_length()



            while r > l:

                if l <= lm:

                    yield l

                if r <= rm:

                    yield r

                r >>= 1

                l >>= 1

            while l:

                yield l

                l >>= 1



    def propagates(self, *ids):

        for i in reversed(ids):

            v = self.lazy[i]

            if v is None:

                continue

            self.lazy[2 * i] = v

            self.lazy[2 * i + 1] = v

            self.data[2 * i] = v

            self.data[2 * i + 1] = v

            self.lazy[i] = None



    def update(self, l, r, x):

        *ids, = self.gindex(l, r)

        self.propagates(*ids)

        l += self.num

        r += self.num

        while l < r:

            if l & 1:

                self.lazy[l] = x

                self.data[l] = x

                l += 1

            if r & 1:

                self.lazy[r - 1] = x

                self.data[r - 1] = x

            r >>= 1

            l >>= 1

        for i in ids:

            self.data[i] = self.segfunc(self.data[2 * i], self.data[2 * i + 1])





    def query(self, l, r):

        *ids, = self.gindex(l, r)

        self.propagates(*ids)



        res = self.ide_ele



        l += self.num

        r += self.num

        while l < r:

            if l & 1:

                res = self.segfunc(res, self.data[l])

                l += 1

            if r & 1:

                res = self.segfunc(res, self.data[r - 1])

            l >>= 1

            r >>= 1

        return res



def segfunc(x, y):

    return min(x, y)



ide_ele =  10**9





N, Q = list(map(int, input().split()))

ans = (N-2)*(N-2)

R = [N]*(N+1)

W = [N]*(N+1)

seg_r = LazySegmentTree(R, segfunc, ide_ele)

seg_w = LazySegmentTree(W, segfunc, ide_ele)

for i in range(Q):

    a, b = list(map(int, input().split()))

    if a == 1:

        t = seg_r.query(b, b+1)

        ans -= max(0, t - 2)

        if b <= seg_w.query(1, 2):

            seg_w.update(1, t+1, b)

    else:

        t = seg_w.query(b, b+1)

        ans -= max(0, t - 2)

        if b <= seg_r.query(1, 2):

            seg_r.update(1, t+1, b)

print(ans)
class LazySegmentTree:
    """
    init(init_val, ide_ele): 配列init_valで初期化 O(N)
    update(l, r, x): 区間[l, r)をxに更新 O(logN)
    query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
    """

    def __init__(self, init_val, segfunc, ide_ele):
        """
        init_val: 配列の初期値
        segfunc: 区間にしたい操作
        ide_ele: 単位元
        num: n以上の最小の2のべき乗
        data: 値配列(1-index)
        lazy: 遅延配列(1-index)
        """
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.data = [ide_ele] * 2 * self.num
        self.lazy = [None] * 2 * self.num
        # 配列の値を葉にセット
        for i in range(n):
            self.data[self.num + i] = init_val[i]
        # 構築していく
        for i in range(self.num - 1, 0, -1):
            self.data[i] = self.segfunc(self.data[2 * i], self.data[2 * i + 1])

    def gindex(self, l, r):
        """
        伝搬する対象の区間を求める
        lm: 伝搬する必要のある最大の左閉区間
        rm: 伝搬する必要のある最大の右開区間
        """
        l += self.num
        r += self.num
        lm = l >> (l & -l).bit_length()
        rm = r >> (r & -r).bit_length()
        while r > l:
            if l <= lm:
                yield l
            if r <= rm:
                yield r
            r >>= 1
            l >>= 1
        while l:
            yield l
            l >>= 1

    def propagates(self, *ids):
        """
        遅延伝搬処理
        ids: 伝搬する対象の区間
        """
        for i in reversed(ids):
            v = self.lazy[i]
            if v is None:
                continue
            self.lazy[2 * i] = v
            self.lazy[2 * i + 1] = v
            self.data[2 * i] = v
            self.data[2 * i + 1] = v
            self.lazy[i] = None

    def update(self, l, r, x):
        """
        区間[l, r)の値をxに更新
        l, r: index(0-index)
        x: update value
        """
        (*ids,) = self.gindex(l, r)
        self.propagates(*ids)
        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                self.lazy[l] = x
                self.data[l] = x
                l += 1
            if r & 1:
                self.lazy[r - 1] = x
                self.data[r - 1] = x
            r >>= 1
            l >>= 1
        for i in ids:
            self.data[i] = self.segfunc(self.data[2 * i], self.data[2 * i + 1])

    def query(self, l, r):
        """
        [l, r)のsegfuncしたものを得る
        l: index(0-index)
        r: index(0-index)
        """
        (*ids,) = self.gindex(l, r)
        self.propagates(*ids)
        res = self.ide_ele
        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.data[l])
                l += 1
            if r & 1:
                res = self.segfunc(res, self.data[r - 1])
            l >>= 1
            r >>= 1
        return res


def segfunc(x, y):
    return min(x, y)


ide_ele = 10**9
N, Q = list(map(int, input().split()))
ans = (N - 2) * (N - 2)
R = [N] * (N + 1)
W = [N] * (N + 1)
seg_r = LazySegmentTree(R, segfunc, ide_ele)
seg_w = LazySegmentTree(W, segfunc, ide_ele)
for i in range(Q):
    a, b = list(map(int, input().split()))
    if a == 1:
        t = seg_r.query(b, b + 1)
        ans -= max(0, t - 2)
        if b <= seg_w.query(1, 2):
            seg_w.update(1, t + 1, b)
        seg_r.update(b, b + 1, 0)
    else:
        t = seg_w.query(b, b + 1)
        ans -= max(0, t - 2)
        if b <= seg_r.query(1, 2):
            seg_r.update(1, t + 1, b)
        seg_w.update(b, b + 1, 0)
print(ans)

class LazySegmentTree:
    def __init__(self, init_val, segfunc, ide_ele):
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.data = [ide_ele] * 2 * self.num
        self.lazy = [None] * 2 * self.num
        for i in range(n):
            self.data[self.num + i] = init_val[i]
        for i in range(self.num - 1, 0, -1):
            self.data[i] = self.segfunc(self.data[2 * i], self.data[2 * i + 1])

    def gindex(self, l, r):
        l += self.num
        r += self.num
        lm = l >> (l & -l).bit_length()
        rm = r >> (r & -r).bit_length()
        while r > l:
            if l <= lm:
                yield l
            if r <= rm:
                yield r
            r >>= 1
            l >>= 1
        while l:
            yield l
            l >>= 1

    def propagates(self, *ids):
        for i in reversed(ids):
            v = self.lazy[i]
            if v is None:
                continue
            self.lazy[2 * i] = v
            self.lazy[2 * i + 1] = v
            self.data[2 * i] = v
            self.data[2 * i + 1] = v
            self.lazy[i] = None

    def update(self, l, r, x):
        (*ids,) = self.gindex(l, r)
        self.propagates(*ids)
        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                self.lazy[l] = x
                self.data[l] = x
                l += 1
            if r & 1:
                self.lazy[r - 1] = x
                self.data[r - 1] = x
            r >>= 1
            l >>= 1
        for i in ids:
            self.data[i] = self.segfunc(self.data[2 * i], self.data[2 * i + 1])

    def query(self, l, r):
        (*ids,) = self.gindex(l, r)
        self.propagates(*ids)
        res = self.ide_ele
        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.data[l])
                l += 1
            if r & 1:
                res = self.segfunc(res, self.data[r - 1])
            l >>= 1
            r >>= 1
        return res


def segfunc(x, y):
    return min(x, y)


ide_ele = 10**9
N, Q = list(map(int, input().split()))
ans = (N - 2) * (N - 2)
R = [N] * (N + 1)
W = [N] * (N + 1)
seg_r = LazySegmentTree(R, segfunc, ide_ele)
seg_w = LazySegmentTree(W, segfunc, ide_ele)
for i in range(Q):
    a, b = list(map(int, input().split()))
    if a == 1:
        t = seg_r.query(b, b + 1)
        ans -= max(0, t - 2)
        if b <= seg_w.query(1, 2):
            seg_w.update(1, t + 1, b)
    else:
        t = seg_w.query(b, b + 1)
        ans -= max(0, t - 2)
        if b <= seg_r.query(1, 2):
            seg_r.update(1, t + 1, b)
print(ans)

-    """ -    init(init_val, ide_ele): 配列init_valで初期化 O(N) -    update(l, r, x): 区間[l, r)をxに更新 O(logN) -    query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN) -    """ - -        """ -        init_val: 配列の初期値 -        segfunc: 区間にしたい操作 -        ide_ele: 単位元 -        num: n以上の最小の2のべき乗 -        data: 値配列(1-index) -        lazy: 遅延配列(1-index) -        """ -        # 配列の値を葉にセット -        # 構築していく -        """ -        伝搬する対象の区間を求める -        lm: 伝搬する必要のある最大の左閉区間 -        rm: 伝搬する必要のある最大の右開区間 -        """ -        """ -        遅延伝搬処理 -        ids: 伝搬する対象の区間 -        """ -        """ -        区間[l, r)の値をxに更新 -        l, r: index(0-index) -        x: update value -        """ -        """ -        [l, r)のsegfuncしたものを得る -        l: index(0-index) -        r: index(0-index) -        """ -        seg_r.update(b, b + 1, 0) -        seg_w.update(b, b + 1, 0)