#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=5e5+5;
int n,pos,m;
int a[N];
int dis[N];
int ansp=1e18,ansq=1;
bool check(int x){
	if(dis[pos]<=x) return 1;
	int p=n,q=1;
	for(int i=1;i<n;i++){
		if(dis[i]<=x) q++,p+=dis[i];
	}
	if(p*ansq<q*ansp) ansp=p,ansq=q;
	return p<q*x;
}
signed main(){
	cin>>n>>pos>>m;
	for(int i=1;i<=m;i++) cin>>a[i];
//	cout<<pos<<'\n';
	if(!pos) return cout<<"0 1",0;
	pos=(n-pos)%n;
	for(int i=1;i<=n;i++) dis[i]=1e18;
	queue<int>q;q.push(0);
	while(!q.empty()){
		int x=q.front();q.pop();
//		cout<<x<<' '<<dis[x]<<'\n';
		for(int i=1;i<=m;i++){
			int w=(a[i]+x)%n;
			if(dis[w]>dis[x]+1) dis[w]=dis[x]+1,q.push(w);
		}
	}
	if(dis[pos]<1e18) ansp=dis[pos];
//	cout<<pos<<' '<<ansp<<'\n';
	int l=0,r=n;
	while(l<=r){
		int mid=l+r>>1;
//		cout<<mid<<' '<<ansp<<' '<<ansq<<'\n';
		if(check(mid)) r=mid-1;
		else l=mid+1;
	}
	cout<<ansp/__gcd(ansp,ansq)<<' '<<ansq/__gcd(ansp,ansq);
	return 0;
}