// Problem: A - Fortune Wheel
// URL: https://vjudge.net/contest/639440#problem/A
// Written by WRuperD

#include<bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int mininf = 1e9 + 7;
#define int long long
#define pb emplace_back
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
inline void write(int x){if(x<0){x=~(x-1);putchar('-');}if(x>9)write(x/10);putchar(x%10+'0');}
#define put() putchar(' ')
#define endl puts("")
const int MAX = 1e5 + 10;

int a[MAX];
int dis[MAX];


pair <int, int> b[MAX];

void solve(){
	int n = read(), s = read(), k = read();
	for(int i = 1; i <= k; i++){
		a[i] = read();
	}
	queue <int> que;
	memset(dis, -1, sizeof(dis));
	dis[0] = 0;
	que.push(0);
	while(!que.empty()){
		int u = que.front();
		que.pop();
		for(int i = 1; i <= k; i++){
			int v = (u - a[i] + n) % n;
			if(dis[v] != -1)	continue;
			dis[v] = dis[u] + 1;
			que.push(v);
		}
	} 
	for(int i = 0; i < n; i++){
		if(dis[i] == -1)	dis[i] = inf;
	}
	for(int i = 0; i < n; i++){
		b[i].first = dis[i], b[i].second = i;
		if(b[i].second == s){
			b[i].second = n + 1;
			// write(b[i].first);
		}
 	}
 	sort(b, b + n);
 	int base = 0;
 	int ansp = n, ansq = 1;
 	for(int j = 1; j < n; j++){
 		if(b[j].second == n + 1){
 			// write(b[j].first), endl;
 			int nowp = b[j].first, nowq = 1;
 			// write(b[])
 			if(ansq * nowp < nowq * ansp){
	 			ansp = nowp, ansq = nowq;
	 		}
 			break;
 		}
 		base += b[j].first;
 		int nowq = j + 1, nowp = base + n;
 		// write(base), endl;
 		// write(nowp), put(), write(nowq), endl;
 		if(ansq * nowp < nowq * ansp){
 			ansp = nowp, ansq = nowq;
 		}
 	}
 	// write(ansp), endl;
 	int com = __gcd(ansp, ansq);
 	write(ansp / com), put(), write(ansq / com), endl;
}

signed main(){
	int t = 1;
	while(t--)	solve();
	return 0;
}