#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

int const maxn=;

int n,la,lb,a[maxn],b[maxn],p[][],ansa,ansb;

void init()

{

  p[][]=p[][]=; p[][]=p[][]=;

  p[][]=p[][]=; p[][]=p[][]=;

  p[][]=p[][]=; p[][]=p[][]=;

  p[][]=p[][]=; p[][]=p[][]=;

  p[][]=p[][]=; p[][]=p[][]=;

}

int main()

{

  init();

  scanf("%d%d%d",&n,&la,&lb);

  for(int i=;i<=la;i++)scanf("%d",&a[i]);

  for(int i=;i<=lb;i++)scanf("%d",&b[i]);

  for(int i=,ta=,tb=;i<=n;i++)

    {

      ansa+=p[a[ta]][b[tb]]; ansb+=p[b[tb]][a[ta]];

      ta++; tb++;

      if(ta==la+)ta=; if(tb==lb+)tb=;

    }

  printf("%d %d\n",ansa,ansb);

  return ;

}