#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1e5+5;
const int mod=1e9+7;
struct Edge
{
int to;
int next;
}edge[maxn];
int head[maxn],tot;
int low[maxn],dfn[maxn],Stack[maxn],belong[maxn];
int index,top;
int scc;
bool instack[maxn];
int num[maxn];
int n,m;
int num_a[maxn];
int num_b[maxn];
int cnt_a,cnt_b;
void addage(int u,int v)
{
edge[tot].to=v;
edge[tot].next=head[u];
head[u]=tot++;
}
void Tarjan(int u)
{
int v;
low[u]=dfn[u]=++index;
Stack[top++]=u;
instack[u]=true;
for(int i=head[u];i!=-1;i=edge[i].next)
{
v=edge[i].to;
if(!dfn[v])
{
Tarjan(v);
if(low[u]>low[v]) low[u]=low[v];
}
else if(instack[v]&&low[u]>dfn[v])
{
low[u]=dfn[v];
}
}
if(low[u]==dfn[u])
{
scc++;
do
{
v=Stack[--top];
instack[v]=false;
belong[v]=scc;
num[scc]++;
}
while(v!=u);
}
}
void solve(int n)
{
memset(dfn,0,sizeof(dfn));
memset(instack,false,sizeof(instack));
memset(num,0,sizeof(num));
index=scc=top=0;
for(int i=0;i<n;i++)
{
if(!dfn[i])
{
Tarjan(i);
}
}
}
void init()
{
tot=0;
memset(head,-1,sizeof(head));
}
int main()
{
int kase=1;
while(~scanf("%d%d",&n,&m))
{
int x;
init();
for(int i=0;i<n;i++)
{
scanf("%d",&x);
addage(i,x);
}
solve(n);
cnt_a=scc;
for(int i=1;i<=scc;i++)
{
num_a[i-1]=num[i];
}
init();
for(int i=0;i<m;i++)
{
scanf("%d",&x);
addage(i,x);
}
solve(m);
cnt_b=scc;
for(int i=1;i<=scc;i++)
{
num_b[i-1]=num[i];
}
int ans=1;
int tmp=0;
for(int i=0;i<cnt_a;i++)
{
tmp=0;
for(int j=0;j<cnt_b;j++)
{
if(num_a[i]>=num_b[j]&&num_a[i]%num_b[j]==0)
{
tmp+=num_b[j];
tmp%=mod;
}
}
ans=(ans*tmp)%mod;
}
printf("Case #%d: %d\n",kase++,ans);
}
return 0;
}