// Not afraid to dark.

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

#define ll long long

#define inline __inline__ __attribute__ ((always_inline))

namespace io {
	int pos;
	inline int read (int &p = pos){
		static int v; static char c;
		v = 1, c = getchar (), p = 0;
		while (! isdigit (c)){
			if (c == '-')
				v = - 1;
			c = getchar ();
		}
		while (isdigit (c)){
			p = (p << 1) + (p << 3) + (c - 48);
			c = getchar ();
		}
		return p *= v;
	}
	inline void write (ll x){
		if (x < 0)
			putchar ('-'), x = - x;
		static int sta[65], top;
		top = 0;
		do {
			sta[++ top] = x % 10;
			x /= 10;
		} while (x);
		while (top)
			putchar (sta[top --] + 48);
	}
};

const int N = 1e5, M = 5e7, inf = 0x3f3f3f3f;
int firs[N + 5], nex[M + 5], to[M + 5], tot;
int n, x, m;
vector < int > rg;

struct frac {
	ll a, b;
	frac (int _a_ = 0, int _b_ = 1){
		a = _a_;
		b = _b_;
	}
	inline void flush (){
		static int g;
		g = __gcd (a, b);
		a /= g, b /= g;
	}
	inline frac friend operator * (const frac a, const frac b){
		frac res (a.a * b.a, a.b * b.b); res.flush ();
		return res;
	}
	inline bool friend operator < (const frac a, const frac b){
		return a.a * b.b < a.b * b.a;
	}
} ans;

inline void Add (int u, int v){
	++ tot;
	nex[tot] = firs[u];
	firs[u] = tot;
	to[tot] = v;
}

int dis[N + 5];
pair < int , int > op[N + 5];

inline void Bfs (){
	queue < int > Q;
	Q.push (0);
	for (int i = 1;i < n;++ i)
		dis[i] = n + 1;
	while (! Q.empty ()){
		int u = Q.front ();
		Q.pop ();
		for (int e = firs[u], v;e;e = nex[e]){
			v = to[e];
			if (dis[v] > dis[u] + 1){
				dis[v] = dis[u] + 1;
				Q.push (v);
			}
		}
	}
}

signed main (){
	io::read (n), io::read (x), io::read (m);
	while (m --)
		rg.push_back (io::read ());
	for (int i = 0;i < n;++ i)
		for (int x : rg)
			Add (i, (i + n - x) % n);
	Bfs ();
	for (int i = 0;i < n;++ i)
		op[i + 1] = make_pair (dis[i], i);
	sort (op + 1, op + n + 1);
	ans = frac (dis[x], 1);
	ll sum = 0;
	for (int i = 1, u;i < n;++ i){
		u = op[i].second;
		if (u == x)
			break;
		sum += dis[u];
		ans = min (frac (sum + n, i), ans);
		ans.flush ();
	}
	io::write (ans.a), putchar (' '), io::write (ans.b), putchar ('\n');
	return 0;
}