#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=100010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

int n,dis[N],x,k,na[N];
bool bio[N];

bool le(pll a,pll b)
{
	return a.x*b.y<a.y*b.x;
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	memset(dis,63,sizeof(dis));
	cin>>n>>x>>k;
	for (int i=0;i<k;++i) cin>>na[i];
	queue<pii> q;
	q.push({0,0});
	while (q.size())
	{
		int i=q.front().x,di=q.front().y;
		q.pop();
		if (bio[i]) continue;
		bio[i]=1;
		dis[i]=di;
		for (int j=0;j<k;++j)
		{
			int nov=i+na[j];
			if (nov>=n) nov-=n;
			q.push({nov,di+1});
		}
	}
	sort(dis,dis+n);
	pll mi={dis[(n-x)%n],1};
	ll s=0;
	for (int i=0;i<n;++i) if (dis[i]<MOD)
	{
		s+=dis[i];
		pll nov={n+s,i+1};
		if (le(nov,mi)) mi=nov;
	}
	ll g=gcd(mi.x,mi.y);
	cout<<mi.x/g<<' '<<mi.y/g<<en;
}