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

const int maxn = 1e5 + 10;
int to[maxn],dis[maxn];long long ansZ,ansM;

void update(long long zi,long long mu)
{
	long double ans = ansZ / ansM,now = zi / mu;
	if(now < ans)
	{
		int g = __gcd(zi,mu);
		mu /= g,zi /= g;
		ansM = mu;
		ansZ = zi;
	}
}

signed main()
{
	int n,x,k;cin >> n >> x >> k;
	for(int i = 1;i <= k;i++)cin >> to[i];
	
	queue<int> q;
	memset(dis,63,sizeof(dis));
	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);
			}
		}
	}
	ansZ = dis[x],ansM = 1;
	sort(dis,dis + n);
	for(int i = 0;i < n && dis[i] < 1e9;i++)
	{
		dis[i] += (!i ? 0 : dis[i - 1]);
		update(n + dis[i],i + 1);
	}
	cout << ansZ << " " << ansM << '\n';
	return 0;
}