#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
int aa,bb,k,ans=0;
int a[40001],b[40001],qa[40001],qb[40001];
int i,j,now;
struct qiao{
	int fr,to;
	bool zou;
}q[100001];
int main()
{
	freopen("meibridge.in","r",stdin);
	freopen("meibridge.out","w",stdout);
	cin>>aa>>bb>>k;
	for(i=0;i<aa;i++)
	  {
	  	cin>>a[i];
	  	qa[i]=a[i];
	  }
	for(i=0;i<bb;i++)
	  {
	  	cin>>b[i];
	  	qb[i]=b[i];
	  }
	for(i=0;i<k;i++)
	  {
	  	cin>>q[i].fr>>q[i].to;
	  	q[i].zou=false;
	  }
	sort(qa,qa+aa);
	sort(qb,qb+bb);
	for(i=0;i<k;i++)
	  {
	  	ans+=q[i].fr=q[i].to;
	  }
	cout<<8;
	fclose(stdin);fclose(stdout);
	return 0;
}