// #include "atcoder/all"
#include <bits/stdc++.h>
using ll = long long;
const int MOD1000000007 = 1000000007;
const int MOD998244353 = 998244353;
const double PI = 3.14159265358979323846264338327950288;
void solve();
int main()
{
// std::ios_base::sync_with_stdio(false);
// std::cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int testcase = 1;
// scanf("%d", &testcase);
while (testcase--)
solve();
return 0;
}
const int N = 2e4 + 5;
int grid[N][20];
int send[N][20], receive[20];
void solve()
{
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
scanf("%d", &grid[i][j]);
}
}
while (k--)
{
int x, y;
scanf("%d%d", &x, &y);
send[x][y]++;
receive[y]++;
}
for (int i = 1; i <= n; i++)
{
int ans = 0;
for (int j = 1; j <= m; j++)
{
if (grid[i][j])
{
ans += receive[j];
ans -= send[i][j];
}
}
printf("%d ", ans);
}
printf("\n");
}
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |