3 3 20
4 4
2 4
2 2
2 2
2 2
5 5
2 2
2 2
2 2
5 5
5 5
3 5
4 2
2 2
5 5
5 5
3 5
5 5
2 2
3 3
 1 10 10
1 19
2 12
2 8
2 16
2 2
2 4
1 9
2 18
2 14
2 10
 10 10 10
2 6
17 7
5 19
14 14
10 10
16 2
6 10
7 17
18 2
17 1
 10 10 10
12 10
8 4
10 8
15 13
11 11
8 6
9 19
13 19
6 4
19 19
 3 3 20
5 5
6 6
6 6
6 2
6 4
6 6
6 6
5 3
5 5
6 4
6 2
5 1
5 1
6 6
6 6
6 2
5 5
6 4
5 3
6 4
 3 3 20
1 1
4 4
1 1
4 4
3 3
1 1
3 1
6 6
1 1
4 6
3 1
3 3
6 4
3 1
6 6
4 6
3 1
4 6
4 6
5 1
 1 10 10
2 10
1 9
2 12
2 18
2 4
2 8
2 20
2 2
2 6
2 14
 10 10 10
2 10
4 6
1 19
7 15
20 18
3 19
11 17
9 17
16 2
19 15
 3 1 20
3 1
1 1
3 1
4 2
4 2
6 2
1 1
5 1
5 1
2 2
4 2
2 2
6 2
4 2
4 2
2 2
1 1
6 2
2 2
6 2
 10 10 10
10 12
19 7
14 12
10 10
8 6
19 19
18 2
12 2
16 4
16 2
 1 1 100
2 2
2 2
1 1
2 2
2 2
1 1
1 1
1 1
2 2
2 2
2 2
1 1
1 1
1 1
1 1
1 1
2 2
1 1
2 2
1 1
2 2
1 1
2 2
2 2
1 1
2 2
1 1
2 2
2 2
2 2
1 1
1 1
2 2
1 1
2 2
2 2
1 1
2 2
1 1
1 1
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
1 1
2 2
2 2
1 1
1 1
1 1
2 2
1 1
2 2
1 1
2 2
1 1
1 1
1 1
2 2
1 1
1 1
2 2
1 1
1 1
2 2
1 1
2 2
1 1
1 1
1 1
2 2
2 2
1 1
1 1
2 2
1 1
2 2
2 2
2 2
1 1
2 2
2 2
2 2
2 2
2 2
1 1
1 1
1 1
2 2
2 2
1 1
1 1
2 2
1 1
1 1
2 2
 1 10 10
1 15
1 19
2 16
1 17
2 4
2 2
2 8
1 11
2 10
2 6
 10 10 10
10 2
19 9
19 17
8 8
5 3
20 4
12 12
2 16
5 19
2 4
 2 2 20
2 4
2 4
1 3
4 2
3 3
2 4
3 3
1 3
1 3
3 3
4 4
3 1
1 3
3 3
2 2
2 4
4 2
4 2
1 1
3 1
 1 10 10
1 19
1 17
2 2
2 10
1 15
2 8
2 6
2 16
2 14
2 4
 10 10 10
8 4
2 4
9 19
16 2
13 7
11 7
7 17
6 6
1 1
15 15
 2 1 2
2 2
1 1
 1 3 100
2 2
1 1
1 5
1 1
2 4
1 1
1 1
2 2
1 1
2 2
2 2
1 1
1 5
2 6
1 1
1 1
2 4
1 3
2 6
1 5
2 6
2 2
2 6
1 1
2 4
1 5
1 1
2 6
1 5
2 4
1 3
2 6
1 5
2 6
2 4
2 2
1 3
2 6
2 4
1 3
1 1
2 2
1 3
1 1
2 6
1 5
1 5
2 4
2 4
1 3
1 5
2 4
2 6
1 3
1 1
1 3
2 6
2 2
2 2
1 1
2 2
2 6
1 5
1 3
2 6
2 4
2 2
2 2
2 6
1 3
1 5
2 2
2 4
2 2
1 3
2 2
1 5
2 4
2 6
2 2
1 5
2 6
2 6
2 6
1 3
1 5
2 2
2 2
1 1
1 5
1 3
1 3
2 2
2 4
1 5
2 2
2 6
1 3
1 3
1 3
 2 2 2
1 3
1 1
 10 10 10
17 11
11 15
8 8
2 4
7 7
9 13
12 8
18 2
15 13
13 17
 1 10 10
2 16
1 1
1 19
2 10
2 4
2 18
2 12
2 6
2 14
2 2
 1 2 100
1 3
2 2
2 4
1 3
2 4
1 1
2 2
1 1
2 4
2 2
2 2
1 3
2 4
1 3
2 4
2 2
2 2
2 4
1 3
2 2
2 4
1 1
2 4
1 3
1 1
1 1
2 4
2 2
1 1
1 3
1 1
1 1
1 1
1 1
2 2
2 4
1 1
1 3
2 4
1 1
1 1
2 4
1 3
1 1
2 4
2 4
1 1
1 1
2 4
2 4
2 4
1 1
2 4
1 3
1 3
2 2
1 1
2 2
1 1
1 3
1 1
2 2
2 4
2 4
2 2
1 3
2 2
1 1
2 4
1 1
2 4
2 4
2 4
2 2
2 2
1 3
2 2
2 2
1 1
2 4
1 1
2 2
2 2
1 1
2 2
1 3
1 3
1 3
1 1
2 4
1 3
1 3
1 1
1 1
1 1
2 4
1 3
1 1
2 4
2 2
 3 3 20
1 1
3 1
1 1
1 1
5 1
3 5
1 3
4 4
1 1
3 1
4 4
4 6
1 3
3 5
6 6
1 1
6 6
1 1
3 3
4 6
 10 10 10
7 19
14 8
15 13
6 6
10 8
18 6
3 1
16 4
8 10
12 12
 10 10 10
4 4
18 20
11 9
1 15
2 2
14 6
2 12
17 9
11 13
8 2
 3 2 10
4 2
6 4
1 3
4 2
6 4
2 2
2 4
1 3
4 4
3 1
 1 10 10
1 11
2 8
1 13
2 2
1 5
1 9
1 3
1 7
1 15
1 17
 10 10 10
15 19
12 8
7 13
12 2
8 10
3 5
13 13
9 9
18 2
5 13
 2 3 20
1 3
1 1
1 1
1 3
2 4
2 4
1 1
2 6
1 1
1 3
3 1
2 6
1 1
2 4
1 1
4 6
1 3
1 3
1 1
3 1
 3 3 20
2 6
1 5
2 6
1 1
1 1
4 6
1 5
1 1
1 1
5 1
1 3
1 3
6 2
6 2
4 6
4 4
3 1
4 4
1 1
1 3
 10 10 10
10 6
7 5
9 13
13 15
19 7
11 13
5 17
16 6
2 14
7 15
 1 1 20
1 1
2 2
2 2
2 2
1 1
2 2
1 1
2 2
1 1
1 1
1 1
1 1
1 1
2 2
1 1
2 2
1 1
1 1
2 2
1 1
 1 1 1
2 2
 1 10 10
2 4
2 8
1 19
2 2
2 10
1 5
2 6
1 17
2 14
1 15
 3 3 20
4 2
3 5
3 1
2 2
3 1
5 5
6 2
6 4
1 5
2 6
5 5
3 1
5 3
3 3
2 6
3 3
2 6
3 3
4 2
1 5
 10 10 10
1 19
3 17
12 4
16 20
5 19
5 17
20 2
15 9
16 4
4 16
 1 10 10
2 4
2 8
2 6
1 17
1 9
1 15
2 10
1 11
2 2
1 13
 10 10 10
9 17
9 13
8 10
12 2
18 14
18 6
10 6
13 19
2 12
10 8
 10 10 10
2 6
5 9
5 15
1 19
6 6
8 4
11 9
13 11
4 6
10 2
 10 10 10
16 2
12 6
8 2
12 2
3 15
6 6
7 17
4 16
11 9
2 6
 10 10 10
18 2
15 13
9 19
6 10
20 18
15 19
2 2
11 13
17 13
3 15
 1 2 1
2 2
 1 10 10
2 4
1 13
1 7
2 14
1 19
1 17
2 2
1 15
1 11
2 6
 1 10 10
1 13
2 4
1 5
2 2
1 19
1 11
1 15
1 17
1 7
2 14
 1 10 10
1 17
2 4
2 2
1 11
1 15
1 19
2 6
2 8
2 12
1 13

YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
 YES
YES
YES
YES
YES
YES
NO
NO
NO
NO
 YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
 YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
 YES
NO
YES
YES
YES
NO
YES
NO
NO
YES
YES
YES
YES
NO
YES
YES
YES
NO
YES
YES
 YES
NO
YES
YES
YES
YES
YES
NO
NO
NO
NO
YES
YES
NO
NO
NO
YES
YES
YES
NO
 YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
 YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
 YES
YES
YES
NO
YES
NO
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
NO
NO
NO
NO
 YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
 YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
YES
NO
YES
NO
YES
NO
YES
YES
YES
NO
YES
YES
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
YES
NO
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
YES
YES
YES
YES
YES
NO
YES
YES
YES
NO
YES
NO
YES
YES
YES
NO
YES
NO
YES
YES
YES
NO
YES
NO
YES
NO
YES
NO
YES
YES
YES
YES
YES
NO
YES
NO
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
YES
YES
 YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
 YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
 YES
YES
YES
YES
YES
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
 YES
YES
YES
YES
YES
YES
YES
NO
NO
NO
 YES
YES
YES
YES
YES
YES
YES
YES
NO
NO
 YES
NO
 YES
NO
NO
YES
YES
NO
YES
YES
NO
NO
NO
YES
YES
YES
NO
YES
YES
NO
YES
YES
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
YES
YES
YES
YES
YES
NO
NO
YES
YES
YES
NO
NO
YES
NO
NO
NO
NO
NO
YES
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
YES
YES
NO
NO
NO
NO
NO
YES
YES
YES
YES
YES
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
 YES
YES
 YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
 YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
 YES
YES
NO
YES
YES
NO
YES
YES
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
NO
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
YES
NO
YES
NO
YES
NO
NO
NO
NO
NO
YES
YES
YES
NO
NO
YES
YES
YES
YES
YES
YES
YES
YES
NO
NO
YES
NO
YES
YES
YES
YES
YES
YES
YES
NO
YES
YES
YES
NO
NO
NO
NO
NO
NO
YES
YES
YES
NO
YES
NO
NO
NO
YES
YES
YES
 YES
YES
YES
YES
YES
YES
YES
NO
NO
NO
YES
NO
NO
YES
NO
NO
NO
YES
NO
YES
 YES
YES
YES
YES
YES
YES
NO
NO
NO
NO
 YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
 YES
YES
NO
NO
YES
YES
NO
YES
YES
NO
 YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
 YES
YES
YES
YES
YES
NO
NO
NO
NO
NO
 YES
YES
YES
YES
YES
YES
YES
NO
YES
NO
NO
YES
YES
NO
NO
NO
NO
NO
NO
NO
 YES
NO
YES
YES
YES
NO
YES
NO
YES
YES
NO
YES
NO
YES
YES
YES
NO
YES
YES
YES
 YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
 YES
NO
YES
NO
YES
YES
YES
NO
YES
NO
YES
NO
YES
YES
YES
NO
YES
NO
YES
YES
 YES
 YES
YES
YES
YES
YES
NO
NO
NO
NO
NO
 YES
YES
NO
NO
YES
YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
 YES
YES
YES
NO
NO
NO
NO
NO
NO
NO
 YES
YES
YES
YES
YES
YES
NO
NO
NO
NO
 YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
 YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
 YES
YES
YES
YES
YES
YES
YES
NO
NO
NO
 YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
 YES
 YES
YES
YES
NO
NO
NO
NO
NO
NO
NO
 YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
 YES
YES
YES
YES
YES
YES
YES
YES
NO
NO

from __future__ import division, print_function

def find_max_sum(arr): 
    incl = 0
    excl = 0
     
    for i in arr: 
          
        # Current max excluding i (No ternary in  
        # Python) 
        new_excl = excl if excl>incl else incl 
         
        # Current max including i 
        incl = excl + i 
        excl = new_excl 
      
    # return max of incl and excl 
    return (excl if excl>incl else incl) 

def main():
    n, m, q = map(int, input().split())
    x = 2 * n
    y = 2 * m
    rows_odd = (x)//2 * (y)//2
    rows_even =  (x) // 2 * (y) //2
    temp = n * m
    queries = []
    for i in range(q):
        a, b = map(int, input().split())
        queries.append((a, b))
    
    low = 0
    high = q - 1
    answer = -1
    
    def check(mid, n, m):
        from collections import deque
        x = 2 * n
        y = 2 * m
        board = []
        for i in range(x):
            board.append([1] * (y))
        
        for i in range(2 * n):
            for j in range(2 * m):
                if (i + j) % 2:
                    board[i][j] = 0
        
        
        for i in range(mid + 1):
            a, b = queries[i]
            board[a - 1][b - 1] = 0

        answer = 0
    
        for i in range(2 * n):
            for j in range(2 * m):
                if board[i][j]:
                    stack = [(i, j, 1)]
                    odd = 0
                    even = 0
                    board[i][j] = 0
                    
                    while stack:
                        i, j, lel = stack.pop()
                        if lel:
                            odd += 1
                        else:
                            even += 1
                        
                        
                        if (i - 1) >= 0 and (j - 1) >= 0:
                            if board[i-1][j-1] == 1:
                                stack.append((i-1, j-1, lel ^ 1))
                                board[i-1][j-1] = 0
                                
                                
                        if (i + 1) < (2 * n) and (j - 1) >= 0:
                            if board[i + 1][j - 1] == 1:
                                stack.append((i + 1, j -1, lel ^ 1))
                                board[i + 1][j - 1] = 0
                                
                        
                        if (i + 1) < ( 2 * n) and (j + 1 ) < 2 * m:
                            if board[i+1][j+1] == 1:
                                stack.append((i + 1, j + 1, lel ^ 1))
                                board[i+1][j+1] = 0
 
                        
                        if (i - 1) >= 0 and (j + 1) < 2 * m:
                            if board[i - 1][j + 1] == 1:
                                board[i - 1][j + 1] = 0

                                stack.append((i - 1, j + 1, lel ^ 1))
                        
                    answer += max(odd, even)
    
        if answer >= n * m:
            return True
        else:
            return False
        
    
    
    while low <= high:
        mid = (low + high)//2
        if check(mid, n, m):
            low = mid + 1
            answer = max(answer, mid)
        else:
            high = mid - 1

    
    for i in range(q):
        if i <= answer:
            print("YES")
        else:
            print("NO")
        

######## Python 2 and 3 footer by Pajenegod and c1729

# Note because cf runs old PyPy3 version which doesn't have the sped up
# unicode strings, PyPy3 strings will many times be slower than pypy2.
# There is a way to get around this by using binary strings in PyPy3
# but its syntax is different which makes it kind of a mess to use.

# So on cf, use PyPy2 for best string performance.

py2 = round(0.5)
if py2:
    from future_builtins import ascii, filter, hex, map, oct, zip
    range = xrange

import os, sys
from io import IOBase, BytesIO

BUFSIZE = 8192
class FastIO(BytesIO):
    newlines = 0

    def __init__(self, file):
        self._file = file
        self._fd = file.fileno()
        self.writable = "x" in file.mode or "w" in file.mode
        self.write = super(FastIO, self).write if self.writable else None

    def _fill(self):
        s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
        self.seek((self.tell(), self.seek(0,2), super(FastIO, self).write(s))[0])
        return s

    def read(self):
        while self._fill(): pass
        return super(FastIO,self).read()

    def readline(self):
        while self.newlines == 0:
            s = self._fill(); self.newlines = s.count(b"\n") + (not s)
        self.newlines -= 1
        return super(FastIO, self).readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.getvalue())
            self.truncate(0), self.seek(0)

class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        if py2:
            self.write = self.buffer.write
            self.read = self.buffer.read
            self.readline = self.buffer.readline
        else:
            self.write = lambda s:self.buffer.write(s.encode('ascii'))
            self.read = lambda:self.buffer.read().decode('ascii')
            self.readline = lambda:self.buffer.readline().decode('ascii')


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip('\r\n')

# Cout implemented in Python
import sys
class ostream:
    def __lshift__(self,a):
        sys.stdout.write(str(a))
        return self
cout = ostream()
endl = '\n'

# Read all remaining integers in stdin, type is given by optional argument, this is fast
def readnumbers(zero = 0):
    conv = ord if py2 else lambda x:x
    A = []; numb = zero; sign = 1; i = 0; s = sys.stdin.buffer.read()
    try:
        while True:
            if s[i] >= b'0' [0]:
                numb = 10 * numb + conv(s[i]) - 48
            elif s[i] == b'-' [0]: sign = -1
            elif s[i] != b'\r' [0]:
                A.append(sign*numb)
                numb = zero; sign = 1
            i += 1
    except:pass
    if s and s[-1] >= b'0' [0]:
        A.append(sign*numb)
    return A

if __name__== "__main__":
  main()