#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e5+10,M=510;
int e[M],dis[N],n,K;
void get(){
    memset(dis,0x3f,sizeof(dis));
    dis[0]=0;queue<int>q;
    q.push(0);
    while(!q.empty()){
        int x=q.front();q.pop();
        for(int i=1;i<=K;i++){
            int nxt=(x-e[i]+n)%n;
            if(dis[nxt]==0x3f3f3f3f){
                dis[nxt]=dis[x]+1;
                q.push(nxt);
            }
        }
    }
}
int vis[N],id[N];
int cmp(int x,int y){
    return dis[x]<dis[y];
}
ll gcd(ll x,ll y){
    if(!y)return x;
    return gcd(y,x%y);
}
int main(){
    int x;scanf("%d%d%d",&n,&x,&K);
    for(int i=1;i<=K;i++){
        scanf("%d",&e[i]);
    }
    sort(e+1,e+1+K);
    get();
    for(int i=0;i<n;i++)id[i]=i;
    sort(id+1,id+1+n,cmp);
    ll p=dis[x],q=1,sum=0;
    for(int i=1;i<=n;i++)if(id[i]!=x){
        sum+=dis[id[i]];
        if((ll)p*i>(ll)q*(n+sum)){
            p=n+sum,q=i;int d=gcd(p,q);
            p/=d,q/=d;
        }
    }else break;
    printf("%lld %lld\n",p,q);
    return 0;
}