// #pragma GCC optimize(2)
// #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
namespace zzx{
	typedef long long ll;
	typedef unsigned long long uint;
	typedef long double ld;
	// typedef __int128 intl;
    #define pc putchar
    #define gc getchar
    #define et pc('\n')
    #define spc pc(' ')
    #define pb push_back
    #define eb emplace_back
    #define lb lower_bound
    #define pii pair<int,int>
    #define pint pair<int,int>
    #define tiii tuple<int,int,int>
    #define tintl tuple<int,int,int>
    #define mk make_pair
    #define pp pop_back
    #define ppc __builtin_popcount
    #define ppcl __builtin_popcountint
    mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
    template<class T>
    void read(T &num){
        T x=0,f=1;
        char c=gc();
        while(!isdigit(c)){
            if(c=='-') f=-1;
            c=gc();
        }
        while(isdigit(c)){
            x=(x<<3)+(x<<1)+c-48;
            c=gc();
        }
        num=f*x;
    }
    template<class T>
    void write(T x){
        static char buf[40];
        static int len=-1;
        if(x<0) pc('-'),x=-x;
        do{
            buf[++len]=x%10+48;
            x/=10;
        }while(x);
        while(len>=0) pc(buf[len--]);
    }
}
using namespace zzx;
const int maxn=1e5+10;
const int maxm=510;
int n,x,m,k[maxm],head[maxn],tot,dis[maxn];
struct frac{
	ll p,q;
	bool operator < (frac tmp) const{
		return p*tmp.q<tmp.p*q;
	}
}ans;
frac min(frac a,frac b){
	if(a<b) return a;
	return b;
}
struct edge{
	int t,nxt;
}e[maxn*maxm<<1];
void add(int u,int v){
	e[++tot]={v,head[u]};
	head[u]=tot;
}
void bfs(){
	memset(dis,0x3f,sizeof(dis));
	dis[0]=0;
	queue<int> q;
	q.push(0);
	while(!q.empty()){
		int u=q.front();
		q.pop();
		for(int i=head[u];i;i=e[i].nxt){
			if(dis[e[i].t]>dis[u]+1){
				dis[e[i].t]=dis[u]+1;
				q.push(e[i].t);
			}
		}
	}
}
void solve(){
	read(n),read(x),read(m);
	for(int i=1;i<=m;i++){
		read(k[i]);
	}
	for(int i=0;i<n;i++){
		for(int j=1;j<=m;j++){
			add(i,(i+k[j])%n);
			add((i+k[j])%n,i);
		}
	}
	bfs();
	frac ans={dis[x],1};
	sort(dis,dis+n);
	ll sum=0;
	for(int i=0;i<n;i++){
		sum+=dis[i];
		ans=min(ans,{(ll)n+sum,(i+1)});
	}
	int g=__gcd(ans.p,ans.q);
	ans.p/=g,ans.q/=g;
	write(ans.p),spc,write(ans.q);
} 
int main(){
	int t=1;
	// read(t);
	while(t--) solve();
}