#include<bits/stdc++.h>
//#define int long long
#define m_p make_pair
#define p_b push_back 
using namespace std;
inline int rd(){
	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;
}
const int N=1e5+5,INF=0x3f3f3f3f3f3f3f3f;
int n,x,K;
int k[N];
int deep[N];

void bfs(){
	queue<int> q;
	memset(deep,0x3f,sizeof(deep));
	deep[0]=0,q.push(0);
	int u,v;
	while(!q.empty()){
		u=q.front();q.pop();
		for(int i=1;i<=K;i++){
			v=(u+n-k[i])%n;//相当于是逆着走
			if(deep[v]>deep[u]+1){
				deep[v]=deep[u]+1;
				q.push(v);
			}
		}
	}
}
struct frac{
	int up,down;
	bool friend operator <(const frac &a,const frac &b){
		return a.up*b.down<b.up*a.down;
	}
	void clean(){
		int x=__gcd(up,down);
		up/=x,down/=x;
	}
};
signed main(){
	n=rd(),x=rd(),K=rd();
	for(int i=1;i<=K;i++) k[i]=rd();
	bfs();
	frac ans={deep[x],1},tmp;
	sort(deep,deep+n);
	int sum=0;
	for(int i=0;i<n;i++){
		if(deep[i]==INF) break;
		sum+=deep[i];
		tmp={sum+n,i+1};
		if(tmp<ans) ans=tmp;
	}
	ans.clean();
	printf("%d %d\n",ans.up,ans.down);
	return 0;	
}//fdsaaaaaaaaa