这种东西找循环就好了
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;
inline char nc(){
static char buf[100000],*p1=buf,*p2=buf;
if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
return *p1++;
}
inline void read(int &x){
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
inline void read(ll &x){
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
const int N=500005;
int n,m; ll K;
int a[N],b[N];
int lst[N],pnt;
int vst[N],back[N];
int cnt,belong[N];
int lp[N],rp[N],length[N];
int sum[3][N];
inline int Sum(int l,int r,int k){
if (l<=r) return sum[k][r]-sum[k][l-1];
return Sum(lp[belong[r]],r,k)+Sum(l,rp[belong[l]],k);
}
ll Ans1,Ans2;
int main(){
read(n); read(m); read(K);
for (int i=0;i<n;i++) read(a[i]);
for (int i=0;i<m;i++) read(b[i]);
for (int i=0;i<n;i++)
if (!vst[i%m]){
++cnt; lp[cnt]=pnt+1;
lst[++pnt]=i%m,belong[pnt]=cnt,back[i%m]=pnt,vst[i%m]=1;
for (int j=(i+n)%m;j!=i%m;j=(j+n)%m)
lst[++pnt]=j,belong[pnt]=cnt,back[j]=pnt,vst[j]=1;
rp[cnt]=pnt; length[cnt]=pnt-lp[cnt]+1;
}
for (int i=1;i<=m;i++){
for (int j=0;j<3;j++)
sum[j][i]+=sum[j][i-1];
sum[b[lst[i]]][i]++;
}
for (int i=0;i<n;i++){
int p=back[i%m],blo=belong[p];
ll tot=K/n+(K%n>i);
ll round=tot/length[blo],rest=tot%length[blo];
Ans1+=round*Sum(lp[blo],rp[blo],(a[i]+1)%3);
Ans2+=round*Sum(lp[blo],rp[blo],(a[i]+2)%3);
if (rest){
int last=(p-lp[blo]+rest-1)%length[blo]+lp[blo];
Ans1+=Sum(p,last,(a[i]+1)%3);
Ans2+=Sum(p,last,(a[i]+2)%3);
}
}
printf("%lld %lld\n",Ans1,Ans2);
return 0;
}