#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
typedef long long ll;
using namespace std;
#define maxn 100001

const int inf=0x7fffffff;   
int a[maxn];
int b[maxn];
int ans1=0;
int ans2=0;
int aa[5][5]={0,0,1,1,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,1,1,1,0,0,0};
int main()
{
	freopen("rps.in","r",stdin);freopen("rps.out","w",stdout);
    int n,ta,tb;
    cin>>n>>ta>>tb;
    for(int i=0;i<ta;i++)
    {
        cin>>a[i];
    }
    for(int i=0;i<tb;i++)
    {
        cin>>b[i];
    }
    for(int i=0;i<n;i++)
    {
        int k1=a[i%ta],k2=b[i%tb];
        ans1+=aa[k1][k2];
        ans2+=aa[k2][k1];
    }
    cout<<ans1<<" "<<ans2<<endl;
    fclose(stdin);fclose(stdout);
    return 0;
}