# import sys
# from time import time

# sys.stdin=open("input.txt", "r")

dirs = ([-1,-1],[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1])

def tree_age():
    global N
    cTree = [[[] for _ in range(N)] for _ in range(N)]
    # for t in tPos:
    #     dead=0
    #     A = tree[t[0]][t[1]]

    #     for i in range(len(A)):
    #         if feed[t[0]][t[1]]>=A[i]:
    #             feed[t[0]][t[1]]-=A[i]
    #             cTree[t[0]][t[1]].append(A[i]+1)
    #             new_tPos.add(tuple(t))
    #         else:
    #             dead+=(A[i]//2)
    #     feed[t[0]][t[1]]+=dead
    for i in range(N):
        for j in range(N):
            if tree[i][j] == []:
                feed[i][j]+=copy_feed[i][j]
                continue
            A = tree[i][j]
            dead=0
            for t in range(len(A)):
                if feed[i][j]>=A[t]:
                    feed[i][j]-=A[t]
                    cTree[i][j].append(A[t]+1)
                else:
                    dead+=(A[t]//2)
            feed[i][j]+=dead
            feed[i][j]+=copy_feed[i][j]
    return cTree

def spread():
    global N
    # new_list =set()
    # for t in tPos:
    #     A = tree[t[0]][t[1]]

    #     for i in range(len(A)):
    #         if A[i]%5==0:
                
    #             for d in dirs:
    #                 nPos = [t[0]+d[0], t[1]+d[1]]
    #                 if 0<=nPos[0]<N and 0<=nPos[1]<N:
    #                     tree[nPos[0]][nPos[1]].insert(0,1)
    #                     new_list.add(tuple(nPos))

    for i in range(N):
        for j in range(N):
            if tree[i][j]!=[]:
                A = tree[i][j]
                for t in range(len(A)):
                    if A[t]%5==0:
                        for d in dirs:
                            nPos = [i+d[0], j+d[1]]
                            if 0<=nPos[0]<N and 0<=nPos[1]<N:
                                tree[nPos[0]][nPos[1]].insert(0,1)

if __name__=="__main__":
    # start =time()
    N,M,K = map(int, input().split())

    tree = [[[] for _ in range(N)] for _ in range(N)]
    feed = [[5]*N for _ in range(N)]
    copy_feed = [list(map(int, input().split())) for _ in range(N)]
    # print(*tree, sep='\n')
    for _ in range(M):
        r,c, z = map(int, input().split())
        tree[r-1][c-1].append(z)
    # print(*tree, sep='\n')
    # print()
    # print(*feed, sep='\n')

    for _ in range(K):

        tree = tree_age()
        spread()
      
        # for i in range(N):
        #     for j in range(N):
        #         feed[i][j]+=copy_feed[i][j]
    
    # print(*tree, sep='\n')
    ans =0
    for i in range(N):
        for j in range(N):
            ans += len(tree[i][j])
    print(ans)
    # end  = time()
    # print(f"time : {end-start}")