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

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int MX = 1e7 + 47;
LL ans[MX];
int n, s, t;

void f(int i, multiset<int> m)
{
	if (ans[i]) return;
	while (!m.empty())
	{
		int pos = (i + ans[i]) % s;
		auto it = m.lower_bound(pos);
		if (it == m.end()) it = m.begin();
		int pos2 = *it;
		m.erase(it);
		ans[i] += (pos2 - pos + s) % s;
		ans[i] += t;		
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> n >> s >> t;
	
	multiset<int> ms;
	FOR(i, 0, n)
	{
		int a;
		cin >> a;
		ms.insert(a);
	}
	for (auto i : ms) f(i, ms);
	int j = *ms.begin();
	LL val = ans[j];
	FOR(i, 0, s)
	{
		int k = (j - i + s) % s;		
		if (ans[k]) val = ans[k];
		else ans[k] = ++val;
	}
	cout << *min_element(ans, ans + s) << '\n';
	cout << *max_element(ans, ans + s) << '\n';
	LL sum = accumulate(ans, ans + s, 0ll);
	LL g = gcd(sum, s);
	cout << sum / g << '/' << s / g << '\n';
	
	return 0;
}