#include <bits/stdc++.h>
#define int long long
#define mod 1000000007
using namespace std;
int n,k,a[100005],inv[100005],jc[100005],where[100005],size,ans1,ans2=1,cn;
map<int,int> m;
map<int,int> cnt;
void dfs(int x,int y,int k){
	if (x < 0 || k == 0 || y > n) return;
	int cnt = 0,sum = 0;
	for (;y <= n;y++){
		if (a[y] >= (1ll<<x) && cnt != k-1) where[y] = ++cn,cnt++,sum += a[y];
		else break;
	}
	ans1 += sum;
	if (cnt != k-1) dfs(x-1,y,k-cnt);
	else{
		int andd = -1;
		for (;y <= n;y++) m[a[y]]++,where[y] = k,andd = (andd == -1 ? a[y] : andd&a[y]);
		if (andd != -1) ans1 += andd;
	}
}
int ksm(int x,int y){
	int ans = 1;
	while (y){
		if (y&1) ans = ans * x % mod;
		x = x * x % mod,y >>= 1;
	}
	return ans;
}
int C(int x,int y){
	return jc[x]*inv[x-y]%mod*inv[y]%mod;
}
signed main(){
	cin >> n >> k,jc[0] = inv[0] = 1;
	for (int i = 1;i <= n;i++) jc[i] = jc[i-1]*i%mod,inv[i] = ksm(jc[i],mod-2);
	for (int i = 1;i <= n;i++) cin >> a[i],cnt[a[i]]++;
	sort(a+1,a+n+1,[](int a,int b){return(a>b);});
	dfs(31,1,k);
	for (auto i : m) ans2 = ans2*C(cnt[i.first],i.second)%mod;
	cout << ans1 << " " << ans2*jc[k]%mod;
	return 0;
}