#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, X, k, a[510], dis[100010], q[100010];
ll gcd(ll x, ll y){return x<y?gcd(y,x):(y>0?gcd(y,x%y):x);}
int main()
{
	int i, u, v, st = 1, nd = 0, cnt = 0;
	ll s = 0, x, y;
	scanf("%d%d%d", &n, &X, &k);
	for(i = 1; i <= k; i++) scanf("%d", &a[i]);
	for(i = 0; i < n; i++) dis[i] = n + 1;
	dis[X] = 0; q[++nd] = X;
	while(st <= nd){
		u = q[st++];
		for(i = 1; i <= k; i++){
			v = u + a[i];
			if(v >= n) v -= n;
			if(dis[u] + 1 < dis[v]){
				dis[v] = dis[u] + 1; q[++nd] = v;
			}
		}
	}
	if(dis[0] <= n) printf("%d 1", dis[0]);
	else{
		for(i = 0; i < n; i++){
			if(dis[i] <= n){
				cnt++; s += dis[i];
			}
		}
		x = s + n; y = cnt;
		printf("%lld %lld", x / gcd(x, y), y / gcd(x, y));
	}
	return 0;
}