#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<chrono>
#include<climits>
#include<cmath>
#include<complex>
#include<condition_variable>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cwchar>
#include<cwctype>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<mutex>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<random>
#include<regex>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<strstream>
#include<thread>
#include<type_traits>
#include<typeinfo>
#include<unordered_map>
#include<utility>
#include<vector>
#define int long long
using namespace std;

int n, x, k, z, m, now;
int a[510], stp[100010];
queue<int> q;

int gcd(int a, int b) {
	if (b == 0)
		return a;
	return gcd(b, a % b);
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n >> x >> k;
	for (int i = 1; i <= k; i++) {
		cin >> a[i];
		a[i] %= n;
	}
	for (int i = 1; i < n; i++) {
		stp[i] = LLONG_MAX;
	}
	q.push(0);
	while (!q.empty()) {
		int u = q.front();
		q.pop();
		for (int i = 1; i <= k; i++) {
			int v = (u - a[i] + n) % n;
			if (stp[v] == LLONG_MAX) {
				stp[v] = stp[u] + 1;
				q.push(v);
			}
		}
	}
	z = min(stp[x], n);
	m = 1;
	sort(stp + 1, stp + n + 1);
	for (int i = 1; i < n; i++) {
		if (stp[i] == LLONG_MAX) {
			break;
		}
		now += stp[i];
		now %= n;
		if ((now + n) * m < z * i) {
			z = now + n;
			m = i;
		}
	}
	int d = gcd(z, m);
	z /= d;
	m /= d;
	cout << z << ' ' << m;

	return 0;
}