#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#define mems(x, v) memset(x, v, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;
typedef pair <int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef long double wisdom;

const int N = 1e5 + 5;
int to[N], dis[N], ansZi, ansMu;
void check(int zi, int mu) {
	wisdom ans = (wisdom)ansZi / ansMu, now = (wisdom)zi / mu;
	if (now < ans) {int g = __gcd(mu, zi); mu /= g, zi /= g; ansMu = mu, ansZi = zi;}
}
int main() {
	int n, x, k; cin >> n >> x >> k;
	for (int i = 1; i <= k; i++) cin >> to[i];

	queue <int> q; mems(dis, 0x3f), dis[0] = 0, q.push(0);
	while (!q.empty()) {
		int u = q.front(); q.pop();
		for (int i = 1; i <= k; i++) {int v = (u - to[i] + n) % n; if (dis[u] + 1 < dis[v]) dis[v] = dis[u] + 1, q.push(v);}
	}
	ansZi = dis[x], ansMu = 1; sort(dis, dis + n);
	for (int i = 0; i < n && dis[i] < 1e9; i++) dis[i] += (!i ? 0 : dis[i - 1]), check(n + dis[i], i + 1);
	cout << ansZi << ' ' << ansMu;
	return 0;
}