#include<bits/stdc++.h>
using namespace std;
int a[500005],b[500005];
typedef long long ll;
struct stats{
	int c[3];
	stats operator +(const stats &o)const{
		stats ans;
		for(int i=0;i<3;i++)ans.c[i]=c[i]+o.c[i];
		return ans;
	}
	stats operator -(const stats &o)const{
		stats ans;
		for(int i=0;i<3;i++)ans.c[i]=c[i]-o.c[i];
		return ans;
	}
}; 
stats cons(int x){
//	printf("cons %d\n",x);
	stats ans;
	for(int i=0;i<3;i++)ans.c[i]=(i==x?1:0);
	return ans;
}
stats pre[500005];
int pos[500005];
vector<int>v[500005];
int main(){
	int n,m;
	ll k;
	scanf("%d%d%lld",&n,&m,&k);
	int gcd=__gcd(n,m);
	ll lcm=1LL*n*m/gcd;
	for(int i=0;i<n;i++)scanf("%d",&a[i]);
	for(int j=0;j<m;j++)scanf("%d",&b[j]);
	for(int j=0;j<gcd;j++){
		for(int tmp=j,cnt=0,lst=m;cnt<m/gcd;lst=tmp,tmp=(tmp+n)%m,cnt++){
			pre[tmp]=pre[lst]+cons(b[tmp]);
//			printf("%d %d %d %d %d\n",tmp,lst,pre[tmp].c[0],pre[tmp].c[1],pre[tmp].c[2]);
			pos[tmp]=cnt;
			v[j].push_back(tmp);
		}
	}
	ll z=k/lcm;
	ll ans1=0,ans2=0;
	for(int i=0;i<n;i++){
		int p=i%gcd;
		p=v[p][m/gcd-1];
//		printf("%d\n",p);
//		printf("%d %d %d\n",pre[p].c[0],pre[p].c[1],pre[p].c[2]);
		ans1+=pre[p].c[(a[i]+1)%3];
		ans2+=pre[p].c[(a[i]+2)%3];
	}
//	printf("%d %d\n",ans1,ans2);
	ans1*=z;
	ans2*=z;
	k-=z*lcm;
	for(int i=0;i<n;i++){
		int cnt=k/n+(i<k%n?1:0);
		if(!cnt)continue;
//		printf("i=%d,cnt=%d\n",i,cnt);
		int pl=pos[i%m];
		int r=i%gcd;
		int pr=(pl+cnt-1+m/gcd)%(m/gcd);
//		printf("%d %d %d %d\n",pl,pr,v[r][pl],v[r][pr]);
		stats tmp;
		pl=(pl-1+m/gcd)%(m/gcd);
		if(pl<=pr)tmp=pre[v[r][pr]]-pre[v[r][pl]];
		else tmp=pre[v[r][m/gcd-1]]-pre[v[r][pl]]+pre[v[r][pr]];
		ans1+=tmp.c[(a[i]+1)%3];
		ans2+=tmp.c[(a[i]+2)%3];
//		printf("ans1=%d,ans2=%d\n",ans1,ans2);
	}
	printf("%lld %lld",ans1,ans2);
	return 0;
	//quod erat demonstrandum
}