#include<bits/stdc++.h>
const int inf=1e6+5;
const int QWQ=1e5+5;
using namespace std;
inline int read(){
	int x=0,f=1; char ch=getchar();
	for (;ch<'0'||ch>'9';ch=getchar())
		if (ch=='-') f=-1;
	for (;ch>='0'&&ch<='9';ch=getchar())
		x=(x<<1)+(x<<3)+(ch^48);
	return x*f;
}
struct node{ int to,next; } E[QWQ*500];
int dep[QWQ],head[QWQ],n,X,K,cnt;
inline void append(int x,int y){
	E[++cnt].to=y;
	E[cnt].next=head[x];
	head[x]=cnt;
}
void bfs(int s){
	for (int i=0;i<n;i++) dep[i]=inf;
	queue<int> q; q.push(s),dep[s]=0;
	while (!q.empty()){
		int u=q.front(); q.pop();
		for (int i=head[u],v;i;i=E[i].next)
			if (dep[v=E[i].to]==inf)
				dep[v]=dep[u]+1,q.push(v);
	}
}
signed main(){
	n=read(),X=read(),K=read();
	for (int i=1;i<=K;i++){
		int k=read();
		for (int u=0;u<n;u++)
			append((u+k)%n,u);
	} 
	bfs(0);
//	for (int i=0;i<n;i++)
//		printf("%d ",dep[i]); puts("");
	int pres=0,A=dep[X],B=1;
	sort(dep,dep+n);
	for (int i=0;i<n;i++)
		if (dep[i]==inf) break;
		else{
			pres+=dep[i];
			if ((i+1)*A>(n+pres)*B) A=n+pres,B=i+1;
		}
	int t=__gcd(A,B);
	printf("%d %d\n",A/t,B/t);
	return 0;
}