#include <bits/stdc++.h>
#define int long long
#define mod 1000000007
using namespace std;
int n,k,a[100005],jc[100005],ans1,ans2=1;
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) 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++) andd = (andd == -1 ? a[y] : andd&a[y]);
		if (andd != -1) ans1 += andd;
	}
}
signed main(){
	cin >> n >> k,jc[0] = 1;
	for (int i = 1;i <= max(n,k);i++) jc[i] = jc[i-1]*i%mod;
	for (int i = 1;i <= n;i++) cin >> a[i];
	sort(a+1,a+n+1,[](int a,int b){return(a>b);});
	dfs(31,1,k);
	cout << ans1 << " " << jc[k];
	return 0;
}