MOD = 1000000007

def count_valid_simple_loops(n, m, k, obstacles, queries):
    # Initialize grid and obstacles
    grid = [[0] * (m + 1) for _ in range(n + 1)]
    for obstacle in obstacles:
        x, y = obstacle
        grid[x][y] = 1
    
    # Initialize dp array
    dp = [[0] * (m + 1) for _ in range(n + 1)]
    dp[1][1] = 1  # Start point
    
    # Compute dp array
    for i in range(1, n + 1):
        for j in range(1, m + 1):
            if i == 1 and j == 1:
                continue
            if grid[i][j] == 1:
                dp[i][j] = 0
            else:
                if i > 1:
                    dp[i][j] += dp[i - 1][j]
                if j > 1:
                    dp[i][j] += dp[i][j - 1]
                dp[i][j] %= MOD
    
    # Compute prefix sums for dp array
    prefix_dp = [[0] * (m + 1) for _ in range(n + 1)]
    for i in range(1, n + 1):
        for j in range(1, m + 1):
            prefix_dp[i][j] = (dp[i][j] + prefix_dp[i - 1][j] + prefix_dp[i][j - 1] - prefix_dp[i - 1][j - 1]) % MOD
    
    # Answer queries
    results = []
    for query in queries:
        x, y = query
        if x > 1:
            result = (prefix_dp[x][y] - prefix_dp[x - 1][y]) % MOD
        else:
            result = prefix_dp[x][y] % MOD
        results.append(result)
    
    return results

# Reading input
import sys
input = sys.stdin.read().split()
n = int(input[0])
m = int(input[1])
k = int(input[2])

obstacles = []
index = 3
for _ in range(k):
    x = int(input[index])
    y = int(input[index + 1])
    obstacles.append((x, y))
    index += 2

Q = int(input[index])
queries = []
index += 1
for _ in range(Q):
    x = int(input[index])
    y = int(input[index + 1])
    queries.append((x, y))
    index += 2

# Solve the problem
results = count_valid_simple_loops(n, m, k, obstacles, queries)

# Print results
for result in results:
    print(result)