MOD = 10**9 + 7

def solve():
    import sys
    input = sys.stdin.read
    data = input().split()
    
    index = 0
    T = int(data[index])
    index += 1
    results = []
    
    for t in range(T):
        n = int(data[index])
        m = int(data[index + 1])
        k = int(data[index + 2])
        index += 3
        
        heights = list(map(int, data[index:index + n + m]))
        index += (n + m)
        
        conditions = []
        for _ in range(k):
            x = int(data[index]) - 1
            y = int(data[index + 1]) - 1
            h = int(data[index + 2])
            conditions.append((x, y, h))
            index += 3
        
        # Initialize the number of ways
        ways = 1
        
        for i in range(n):
            for j in range(m):
                # Calculate the available ways for each cell
                ways = (ways * (heights[i + j] + 1)) % MOD
        
        results.append(f"Case #{t + 1}: {ways}")
    
    print('\n'.join(results))