#include <bits/stdc++.h>
#include <immintrin.h>

using namespace std;

using ll = long long;
using ld = long double;
#define x first
#define y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

mt19937 mt(123);

void solve();
void init();

int32_t main() {
#ifndef LOCAL
    cin.tie(nullptr)->sync_with_stdio(false);
#endif
    cout << fixed << setprecision(30);
    init();
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}

void init() {}

void solve() {
    int n, x, k;
    cin >> n >> x >> k;
    vector<int> go(k);
    for (int i = 0; i < k; i++) {
        cin >> go[i];
    }
    vector<int> dist(n, 2 * n);
    dist[0] = 0;
    queue<int> q;
    q.push(0);
    while (!q.empty()) {
        int s = q.front();
        q.pop();
        for (int i : go) {
            if (dist[(s - i + n) % n] == 2 * n) {
                q.push((s - i + n) % n);
                dist[(s - i + n) % n] = dist[s] + 1;
            }
        }
    }
    ll c1 = 0;
    int c = 0;
    vector<int> count(2 * n + 1, 0);
    for (int i = 0; i < n; i++) {
        c1 += dist[i];
        count[dist[i]]++;
    }
    ll sp = -1, sq = -1;
    for (int val = 2 * n; val > 0; val--) {
        c1 -= val * count[val];
        c += count[val];
        ll s_p = (c1 + n) * n;
        ll s_q = (n - c) * n;
        if (s_p <= val * s_q && s_p >= (val - 1) * s_q) {
            sp = s_p;
            sq = s_q;
            break;
        }
    }
    assert(sp != -1 && sq != -1);
    ll gc = __gcd(sp, sq);
    sp /= gc;
    sq /= gc;
    if (dist[x] * sq <= sp) {
        cout << dist[x] << " 1\n";
    } else {
        cout << sp << ' ' << sq << '\n';
    }
}