//按照题意 只有赢了分数才会改变
//这个题的收获 怎么获得一个周期序列
#include<iostream>

using namespace std;

const int N = 220;
int ta[N], tb[N], a[N], b[N];

int cnta, cntb;

int main()
{
    int win[5][5] = {0 ,-1 ,1 ,1 ,-1 ,1 ,0 ,-1 ,1 ,-1 ,-1 ,1 ,0 ,-1,1,-1,-1,1,0,1,1,1,-1,-1,0};
    int N, NA, NB;
    cin >> N >> NA >> NB;

    for(int i = 0 ; i < NA ; i ++) 
    {
        scanf("%d",&ta[i]);
    }
    for(int i = 0 ; i < NB ; i ++)
    {
        scanf("%d",&tb[i]);
    }

    for(int i = 0 ; i < N ; i ++)
    {
        a[i] = ta[i % NA];
    }
    for(int i = 0 ; i < N ; i ++)
    {
        b[i] = tb[i % NB];
    }

    for(int i= 0 ; i < N ; i++)
    {
        if(win[a[i]][b[i]] == 1) cnta ++;
        if(win[a[i]][b[i]] == -1) cntb ++;
    }
    printf("%d %d",cnta,cntb);

    return 0;
}