#include <algorithm>
#include <cstdio>
#include <vector>
using i32 = int;
using i64 = long long;
constexpr i32 N = 1E5, M = 500;
i32 n, arrow, m;
std::vector<i32> G[N];
i32 dep[N];
i64 gcd(i64 a, i64 b) noexcept { return b ? gcd(b, a % b) : a; }
signed main() noexcept {
	scanf("%d%d%d", &n, &arrow, &m);
	for (i32 i = 0, x, p; i < m; ++i)
		for (scanf("%d", &x), p = 0; p < n; ++p) G[(p + x) % n].emplace_back(p);
	static i32 que[N], *hd, *tl;
	__builtin_memset(dep, -1, sizeof(dep));
	dep[*(hd = tl = que) = 0] = 0;
	for (i32 u; hd <= tl;)
		for (i32 v : G[u = que[*hd++]])
			if (!~dep[v]) dep[*++tl = v] = dep[u] + 1;
	i64 ansx = ~dep[arrow] ? dep[arrow] : 0x3f3f3f3f, ansy = 1, sum = 0;
	std::sort(dep, dep + n), std::reverse(dep, dep + n);
	for (i32 i = 1; i <= n; ++i) {
		if (!~dep[i - 1]) break;
		sum += dep[i - 1];
		i64 x = n + sum, y = i;
		if (x * ansy < ansx * y) ansx = x, ansy = y;
	}
	i64 g = gcd(ansx, ansy);
	printf("%lld %lld\n", ansx /= g, ansy /= g);
	return 0;
}