# include <bits/stdc++.h>
# define maxn 100100
# define int long long
# define rep(i, j, k) for(int i = j; i <= k; ++i)
using namespace std;

int n, x, k, Max, sum, ans1 = 2e9, ans2 = 1;
int a[maxn], dis[maxn], cnt[maxn];
bool vis[maxn];
queue<pair<int, int> > que;

void bfs() {
    que.push({0, 0}); dis[0] = 0; vis[0] = 1;
    while(que.size()) {
        int u = que.front().first; dis[u] = que.front().second; que.pop();
        cnt[dis[u]]++; Max = max(Max, dis[u]);
        rep(i, 1, k) {
            int v = (u - a[i] + n) % n;
            if(!vis[v]) vis[v] = 1, que.push({v, dis[u] + 1});
        }
    }
}

inline int gcd(int x, int y) {int r; while(x && y) r = x % y, x = y, y = r; return x;}

signed main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> x >> k; rep(i, 1, k) cin >> a[i]; memset(dis, 0x3f, sizeof(dis)); bfs();
    // rep(i, 0, n - 1) cerr << i << ' ' << dis[i] << '\n';
    ans1 = dis[x];
    rep(i, 0, Max) {
        sum += cnt[i] * i; cnt[i] += (i ? cnt[i - 1] : 0);
        // cout << i << ' ' << cnt[i] << ' ' << sum << ' ' << 1.0 * (n + sum) / cnt[i] << '\n';
        if(ans1 * cnt[i] > ans2 * (n + sum)) ans1 = n + sum, ans2 = cnt[i];
        if(i == dis[x]) break;
    }
    // cout << ans1 << ' '<< ans2 << '\n';
    // return 0;
    cout << ans1 / gcd(ans1, ans2) << ' ' << ans2 / gcd(ans1, ans2);
    return 0;
}