#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;

int s,t;
int n,m,a[N];

bool v[N];
int d[N];
int bfs(int s){
	memset(d,0x3f,sizeof(d));
	memset(v,0,sizeof(v));
	d[0]=0;
	queue<int>q;
	q.push(s);
	while(q.size()){
		int x=q.front();q.pop();
		if(v[x])continue;
		v[x]=1;
		for(int i=1;i<=m;i++){
			int y=((x-a[i]+n)%n+n)%n;
			if(d[y]>d[x]+1){
				d[y]=d[x]+1;
				q.push(y);
			}
		}
	}
}

int gcd(int a,int b){
	return b?gcd(b,a%b):a;
}

int main(){
	scanf("%d%d%d",&n,&s,&m);
	for(int i=1;i<=m;i++)scanf("%d",&a[i]);
	int ans=0,cnt=0;
	bfs(0);
	for(int i=0;i<n;i++){
		if(d[i]==0x3f3f3f3f)continue;
		ans+=d[i];
//		printf("%d %d\n",i,dist);
		cnt++;
	}
	ans+=n;
	int D=gcd(ans,cnt);
	ans/=D,cnt/=D;
	int dist=d[s];
	if((long long)dist*cnt<ans)printf("%d 1\n",dist);
	else printf("%d %d\n",ans,cnt);
	return 0;
}