#include<bits/stdc++.h> 
#define ri register int
#define ll long long
#define mkp make_pair
#define ld long double 
using namespace std;
const int maxn=1e5+7;
int n,x,K;
int k[maxn];
int f[maxn];
const int inf=1e9;
int a[maxn];
struct Frac{
	ll fz,fm;
	Frac () {}
	Frac (ll a,ll b=1):fz(a),fm(b){
		if(fm<0)fm=-fm,fz=-fz;
		ll g=__gcd(abs(a),abs(b));
		fz/=g;fm/=g;
	}
	friend Frac operator + (Frac a,Frac b){return Frac(a.fz*b.fm+a.fm*b.fz,a.fm*b.fm);}
	friend Frac operator - (Frac a,Frac b){return Frac(a.fz*b.fm-a.fm*b.fz,a.fm*b.fm);}
	friend Frac operator * (Frac a,Frac b){return Frac(a.fz*b.fz,a.fm*b.fm);}
	friend Frac operator / (Frac a,Frac b){return Frac(a.fz*b.fm,a.fm*b.fz);}
	friend bool operator < (Frac a,Frac b){return (a-b).fz<0;}
	friend bool operator > (Frac a,Frac b){return (a-b).fz>0;}
	friend bool operator == (Frac a,Frac b){return (a-b).fz==0;}
	friend bool operator <= (Frac a,Frac b){return !(a>b);}
	friend bool operator >= (Frac a,Frac b){return !(a<b);}
	void print_fs(){cout<<fz<<' '<<fm;}
	void print(){cout<<(ld)(fz)/(ld)(fm);}
};
vector<int>vec[maxn];
void bfs(){
	queue<int>q;
	q.push(0);
	while(!q.empty()){
		int u=q.front();q.pop();
		for(ri i=1;i<=K;i++){
			int v=(u-k[i]+n)%n;
			if(f[v]>f[u]+1){
				f[v]=f[u]+1;
				q.push(v);
			}
		}
	}
}
signed main(){
	ios::sync_with_stdio(0);
	cin>>n>>x>>K;
	for(ri i=1;i<=K;i++)cin>>k[i];
	memset(f,0x3f,sizeof(f));
	f[0]=0;
	bfs();
	for(ri i=0;i<n;i++)a[i]=f[i];
	sort(a,a+n);
	Frac ans=Frac(f[x]);
	ll sum=0;
	for(ri i=0;i<n;i++){
		sum+=a[i];
		ans=min(ans,(Frac(sum)/Frac(i+1))+(Frac(n)/Frac(i+1)));
	}
	ans.print_fs();
	return 0;
}