#include<iostream>
#include<cstdio>
#include<fstream>
#include<queue>
#include<algorithm>
#define fopen(x, y) freopen(x".in", "r", stdin); freopen(y".out", "w", stdout);
#define int long long
#ifdef int
#define inf 0x3f3f3f3f3f3f3f3fll
#else
#define inf 0x3f3f3f3f
#endif

using namespace std;

const int mod = 998244353;

int n, k, a[2005], pn, fac[1000005], ifac[1000005], inv[1000005];

pair<int, int> p[2005];

inline int C(int x, int y) {
	if(y > x || y < 0) return 0;
	return fac[x] * ifac[y] % mod * ifac[x - y] % mod;
}

void work() {
	cin >> n >> k;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	sort(a + 1, a + n + 1);
	int sum = 0;
	for(int i = 1; i <= n; i++) {
		if(a[i] != a[i - 1]) pn++;
		p[pn].first = a[i]; p[pn].second++;
		if(i <= k) sum -= a[i];
		if(i >= n - k + 1) sum += a[i];
	}
	cout << sum << ' ';
	int kl = k, kr = k, pl = 0, pr = 0;
	for(int i = 1; i <= n; i++) {
		if(kl >= p[i].second) kl -= p[i].second;
		else {
			pl = i;
			break;
		}
	}
	for(int i = n; i >= 1; i--) {
		if(kr >= p[i].second) kr -= p[i].second;
		else {
			pr = i;
			break;
		}
	}
	if(pl == pr) {
		if(kl == k && kr == k) {
			cout << C(p[pl].second, kl) * C(p[pr].second - kl, kr) % mod * (mod + 1) / 2 % mod;
		}
		else cout << C(p[pl].second, kl) * C(p[pr].second - kl, kr) % mod << '\n';
	}
	else {
//		cout << p[pl].second << ' ' << kl << ' ' << p[pr].second << ' ' << kr << endl;
		cout << C(p[pl].second, kl) * C(p[pr].second, kr) % mod << '\n';
	}
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(0);
	int _ = 1;
	fac[0] = fac[1] = ifac[0] = ifac[1] = inv[1] = 1;
	for(int i = 2; i <= 1000000; i++) {
		inv[i] = (mod - mod / i) * inv[mod % i] % mod;
		fac[i] = fac[i - 1] * i % mod;
		ifac[i] = ifac[i - 1] * inv[i] % mod;
	}
//	cin >> _;
	while(_--) work();
}