#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+10,mod=1e9+7;
ll n,K,a[N],ans1=0,ans2=1;
ll fac[N],inv[N];
ll maxn=0;
bool vis[N];
vector<ll> p;
ll ksm(ll x,ll k){
	ll tmp=1;
	while(k){
		if(k%2==1) tmp=tmp*x%mod;
		x=x*x%mod;
		k/=2;
	}
	return tmp;
}
void init(){
	fac[0]=1;
	for(int i=1;i<=1000000;i++) fac[i]=fac[i-1]*i%mod;
	inv[1000000]=ksm(fac[1000000],mod-2);
	for(int i=999999;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;
}
ll c(ll x,ll y){
	if(x<y) return 0;
	return fac[x]*inv[y]%mod*inv[x-y]%mod;
}
void get(ll x){
	ll now=0;
	while(x){
		x/=2;
		now++;
	}
	maxn=max(maxn,now-1);
}
ll strling(ll x,ll y){
	if(x<y) return 0;
	if(y==0) return 0;
	if(x==y) return 1;
	if(y==1) return 1;
	return (strling(x-1,y-1)+y*strling(x-1,y)%mod)%mod;
}
void dfs(vector<ll> A,ll k,ll dep) {
	assert(k <= A.size());
	ll cnt0 = 0,cnt1 = 0;
	for(auto i : A) if((i >> dep) & 1) ++cnt1; else ++cnt0;
	ans1 += min(k - (cnt0 > 0),cnt1) * (1ll << dep);
	if(dep == 0) {
		if(k > cnt1) ans2 = 1ll * ans2 * strling(cnt0,k - cnt1) % mod;
		else ans2 = 1ll * ans2 * strling(1 + cnt1,k) % mod;
		return;
	}
	if(k > cnt1) {
		vector<ll> B;
		for(auto i : A) if((~i >> dep) & 1) B.push_back(i); else ans1 += i & ((1 << dep) - 1);
		dfs(B,k - cnt1,dep - 1);
	} else {
		vector<ll> B;ll andsum = INT_MAX;
		for(auto i : A) if((i >> dep) & 1) B.push_back(i); else andsum &= i;
		if(cnt0) B.push_back(andsum);
		dfs(B,k,dep - 1);
	}
}
int main(){
	cin>>n>>K;
	init();
	for(int i=1;i<=n;i++){
		cin>>a[i];
		get(a[i]);
		p.push_back(a[i]);
	}
	dfs(p,K,maxn);
	ans2=ans2*fac[K]%mod;
	cout<<ans1<<" "<<ans2;
	return 0;
}