#include <iostream>
#include <cstdint>
#include <algorithm>

#include <vector>
#include <set>
#include <map>
#include <queue>

using namespace std;

typedef int64_t ll;

void cerrr(vector<vector<pair<ll,ll>>> v) {

    for(const auto & j : v) {
        for(const auto & [x, y] : j) {
            cerr << "{" << x << "," << y << "},";
        }
        cerr << "\n";
    } 

}

void solve() {

    ll n, m, k;
    cin >> n >> m >> k;

    vector<vector<pair<ll,ll>>> foodtoing(n+1);

    vector<ll> ord(n+1, 0);
    vector<vector<pair<ll,ll>>> ingtofood(k+1);

    for(ll i = 1; i <= n; i++) {

        ll ingcount = 0;
        cin >> ingcount;
        foodtoing[i].resize(ingcount);

        //cerr << "\ni=" << i << "; ingcount=" << ingcount;

        for(ll j = 0; j < ingcount; j++) {
            ll ing, quantity;
            cin >> ing >> quantity;

            foodtoing[i][j] = {ing, quantity};
            ingtofood[ing].push_back({i, quantity});
        }
    }

    //cerr << "\nfoodtoing\n";
    //cerrr(foodtoing);
    //cerr << "\ningtofood\n";
    //cerrr(ingtofood);

    for(ll i = 1; i <= m; i++) {
        ll cnt;
        cin >> cnt;

        for(ll i = 0; i < cnt; i++) {
            ll food, howmany;
            cin >> food >> howmany;
            ord[food] += howmany;
        }
    }

    /*
    cerr << "\nord=";
    for(ll i = 1; i <= n; i++) {
        cerr << ord[i] << " ";
    }
    */

    vector<ll> res(k+1, 0);

    for(ll i = 1; i <= k; i++) {
        //cerr << "\ni=" << i;
        for(const auto & [f, q] : ingtofood[i]) {
            res[i] += ord[f] * q;
        }
    }

    //cerr << "\nres calced";

    for(ll i = 1; i <= k; i++) {
        cout << res[i] << " ";
    }

}

int main() {
    
    std::ios_base::sync_with_stdio(false);
    
    solve();
    
    return 0;

}