There is a grid with R rows and C columns. We call the cell in the r-th row and c-th column (r，c).

Mr. Takahashi wrote non-negative integers into N of the cells, that is, he wrote a non-negative integer a_i into (r_i，c_i) for each i (1≤i≤N). After that he fell asleep.

Mr. Aoki found the grid and tries to surprise Mr. Takahashi by writing integers into all remaining cells. The grid must meet the following conditions to really surprise Mr. Takahashi.

* Condition 1: Each cell contains a non-negative integer.
* Condition 2: For any 2×2 square formed by cells on the grid, the sum of the top left and bottom right integers must always equal to the sum of the top right and bottom left integers.



Determine whether it is possible to meet those conditions by properly writing integers into all remaining cells.

Constraints

* 2≤R，C≤10^5
* 1≤N≤10^5
* 1≤r_i≤R
* 1≤c_i≤C
* (r_i，c_i) ≠ (r_j，c_j) (i≠j)
* a_i is an integer.
* 0≤a_i≤10^9

Input

The input is given from Standard Input in the following format:


R C
N
r_1 c_1 a_1
r_2 c_2 a_2
:
r_N c_N a_N


Output

Print `Yes` if it is possible to meet the conditions by properly writing integers into all remaining cells. Otherwise, print `No`.

Examples

Input

2 2
3
1 1 0
1 2 10
2 1 20


Output

Yes


Input

2 3
5
1 1 0
1 2 10
1 3 20
2 1 30
2 3 40


Output

No


Input

2 2
3
1 1 20
1 2 10
2 1 0


Output

No


Input

3 3
4
1 1 0
1 3 10
3 1 10
3 3 20


Output

Yes


Input

2 2
4
1 1 0
1 2 10
2 1 30
2 2 20


Output

No
import sys
readline = sys.stdin.readline
class UFP():
    def __init__(self, num):
        self.par = [-1]*num
        self.dist = [0]*num
    def find(self, x):
        if self.par[x] < 0:
            return x
        else:
            res = 0
            xo = x
            while self.par[x] >= 0:
                res += self.dist[x]
                x = self.par[x]
            self.dist[xo] = res
            self.par[xo] = x
            return x
    
    def union(self, x, y, d):
        rx = self.find(x)
        ry = self.find(y)
        if rx != ry:
            if self.par[rx] > self.par[ry]:
                rx, ry = ry, rx
                x, y = y, x
                d = -d
            self.par[rx] += self.par[ry]
            self.par[ry] = rx
            self.dist[ry] = d + self.dist[x] - self.dist[y]
            return True
        else:
            if d + self.dist[x] - self.dist[y]:
                return False
            return True           
    
INF = 3*10**9
def check():
    H, W = map(int, readline().split())
    N = int(readline())
    Hm = [INF]*H
    Wm = [INF]*W
    HP = [[] for _ in range(H)]
    WP = [[] for _ in range(W)]
    for _ in range(N):
        h, w, a = map(int, readline().split())
        h -= 1
        w -= 1
        Hm[h] = min(Hm[h], a)
        Wm[w] = min(Wm[w], a)
        HP[h].append((w, a))
        WP[w].append((h, a))
        
    Th = UFP(H)
    Tw = UFP(W)
    for h in range(H):
        L = len(HP[h]) 
        if L > 1:
            HP[h].sort()
            for i in range(L-1):
                wp, ap = HP[h][i]
                wn, an = HP[h][i+1]
                if not Tw.union(wp, wn, an-ap):
                    return False
    for w in range(W):
        L = len(WP[w]) 
        if L > 1:
            WP[w].sort()
            for i in range(L-1):
                hp, ap = WP[w][i]
                hn, an = WP[w][i+1]
                if not Th.union(hp, hn, an-ap):
                    return False
    
    cmh = [INF]*H
    for h in range(H):
        rh = Th.find(h)
        cmh[rh] = min(cmh[rh], Th.dist[h])
    cmw = [INF]*W
    for w in range(W):
        rw = Tw.find(w)
        cmw[rw] = min(cmw[rw], Tw.dist[w])
    
    for h in range(H):
        if Hm[h] - Th.dist[h] + cmh[Th.find(h)] < 0:
            return False
    for w in range(W):
        if Wm[w] - Tw.dist[w] + cmw[Tw.find(w)] < 0:
            return False
    return True

print('Yes' if check() else 'No')