#include <bits/stdc++.h>
using namespace std;
#define ll long long

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

int main() {
	ll N, X, K;
	cin >> N >> X >> K;
	vector<ll> Ks(K);
	for(int i = 0; i < K; i++) cin >> Ks[i];

	vector<ll> DP(N, 500*N);
	DP[0] = 0;
	for(int k = 0; k < K; k++) {
		int g = gcd(N, Ks[k]);
		for(int i0 = 0; i0 < g; i0++) {
			for(int c = i0, cc = 0; cc < 2*N/g; cc++, c = (c + N - Ks[k])%N) {
				DP[c] = min(DP[(c+Ks[k])%N]+1, DP[c]);
			}
		}
		//for(int i = 0; i < 2*N; i++)  DP[i%N] = min(DP[(i+Ks[k])%N] + 1, DP[i%N]);
		//for(int i = 2*N; i >= 0; i--) DP[i%N] = min(DP[(i+Ks[k])%N] + 1, DP[i%N]);
	}

	//for(int i = 0; i < DP.size(); i++) cout << DP[i] <<" "; cout << endl;

	vector<ll>DP0(DP);

	sort(DP.begin(), DP.end());



	int dpi = 0;
	int ksum = 0;

	int ct = min(DP0[X], N);
	int cb = 1;

	for(int c = 0; c <= N; c++) {
		while(dpi < N && DP[dpi] <= c) ksum += DP[dpi++];
		int t = ksum + N;
		int b = dpi;
		int g = gcd(t,b);
		//cout << c << " " << t << " " << b << std::endl;
		t /= g;
		b /= g;


		if(t*cb < b*ct) {
			ct= t;
			cb = b;
		}
	}

	cout << ct << " " << cb << std::endl;

}