#include <bits/stdc++.h>
#define lzm0107
using namespace std;
using LL = long long;
using AI2 = array<int, 2>;
using PII = pair<int, int>;
using ULL = unsigned long long;
const int N = 1e6 + 10, P = 1e9 + 7, INV2 = 500000004;

int n, k, a[N], fact[N], finv[N];
map<int, int> mp1, mp2, mp3;

int inv(int a){
	int res = 1;
	for(int i = P - 2; i; i >>= 1, a = 1ll * a * a % P) if(i & 1) res = 1ll * res * a % P;
	return res;
}

int C(int n, int m){return 1ll * fact[n] * finv[m] % P * finv[n - m] % P;}

int main(){
	ios::sync_with_stdio(false);
	*cin.tie(nullptr) << fixed << setprecision(20);
	
	fact[0] = 1;
	for(int i = 1; i <= 1000000; i ++ ) fact[i] = 1ll * fact[i - 1] * i % P;
	finv[1000000] = inv(fact[1000000]);
	for(int i = 999999; i >= 0; i -- ) finv[i] = 1ll * finv[i + 1] * (i + 1) % P;
	
	cin >> n >> k;
	for(int i = 1; i <= n; i ++ ){
		cin >> a[i];
		mp1[a[i]] ++ ;
	}
	sort(a + 1, a + n + 1);
	LL sum1 = 0, sum2 = 0;
	for(int i = 1; i <= k; i ++ ) sum1 += a[i], mp2[a[i]] ++ ;
	for(int i = n; i >= n - k + 1; i -- ) sum2 += a[i], mp3[a[i]] ++ ;
	cout << sum2 - sum1 << ' ';
	int ans2 = 1;
	for(auto i : mp2){
		ans2 = 1ll * ans2 * C(mp1[i.first], i.second) % P;
		mp1[i.first] -= i.second;
	}
	for(auto i : mp3){
		ans2 = 1ll * ans2 * C(mp1[i.first], i.second) % P;
		mp1[i.first] -= i.second;
		if(mp2[i.first] == i.second) ans2 = 1ll * ans2 * INV2 % P;
	}
	cout << ans2 << '\n';
	return 0;
}