#include<bits/stdc++.h>
using namespace std;
void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << h; if(sizeof...(t)) cerr << ", ";
DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL
#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"
using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;
void setIO(string NAME = "") {
cin.tie(0)->sync_with_stdio(0);
if(sz(NAME)) {
freopen((NAME + ".inp").c_str(),"r",stdin);
freopen((NAME + ".out").c_str(),"w",stdout);
}
}
int N, K, P;
ll ans = 0;
map<int,int> ccnt, rcnt, cxor, rxor;
map<pi, int> rook;
void modify(int x, int y, int val) {
ans -= N - ccnt[rxor[x]];
ans -= N - rcnt[cxor[y]];
if(rxor[x] != cxor[y]) ans++;
rcnt[rxor[x]]--;
rxor[x] ^= val;
rcnt[rxor[x]]++;
ccnt[cxor[y]]--;
cxor[y] ^= val;
ccnt[cxor[y]]++;
ans += N - ccnt[rxor[x]];
ans += N - rcnt[cxor[y]];
if(rxor[x] != cxor[y]) ans--;
rook[{x,y}] ^= val;
}
void solve() {
cin>>N>>K>>P;
ccnt[0] = rcnt[0] = N;
F0R(i,K) {
int r,c,x;
cin>>r>>c>>x;
modify(r,c,x);
}
F0R(i,P) {
int r1, c1, r2, c2;
cin>>r1>>c1>>r2>>c2;
int val = rook[{r1, c1}];
modify(r1, c1, val);
modify(r2, c2, val);
cout << ans << nl;
}
}
int main() {
setIO();
int t=1;
//cin>>t;
while(t-->0) {
solve();
}
return 0;
}
