GOLDEN BOY NEXT DOOR

#include <iostream>
#include <vector>
#include <cmath>
#include <valarray>
#include <string>
#include <algorithm>
#include <sstream>

using namespace std;
bool check(vector<vector<long long int>> v, vector<long long int> v1)
{
    int i;
    for (i=0;i<v.size();++i)
        if (v1==v[i])
            return false;
    return true;
}
int main()
{
    long long int summ,k,n,i,j,m,ma,c,o,x,c1;
    cin >> n >> m;
    vector < vector<long long int>> a(n, vector<long long int>(m));
    ma=0;
    k=0;
    o=0;
    c=0;
    summ=0;
    for (i=0;i<n;++i)
        for(j=0;j<m;++j)
            cin >> a[i][j];
    cin >> x;
    vector<vector<long long int>> q(x,vector<long long int>(2));
    long long int i1,j1;
    vector <long long int> q1(2);
    for (i=0;i<x;++i)
    {
        cin>>i1>>j1;
        q1[0]=i1;
        q1[1]=j1;
        if(check(q,q1))
        {
            summ +=a[i1-1][j1-1];
        }
        q[i][0]=i1;
        q[i][1]=j1;

    }

    cout<<summ<<endl;
    return 0;
}