#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=1e5+10,mod=1e9+7;

int n,m;
ll a[N],ans,sum=1;
ll f[N],incf[N];

ll power(ll a,ll b){
	ll ans=1;
	for(;b;b>>=1){
		if(b&1)ans=ans*a%mod;
		a=a*a%mod;
	}
	return ans;
}

void pre_work(int n){
	f[0]=1;
	for(int i=1;i<=n;i++)f[i]=f[i-1]*i%mod;
	incf[n]=power(f[n],mod-2);
	for(int i=n-1;i>=0;i--)incf[i]=incf[i+1]*(i+1)%mod;
}

vector<ll>b,c;

ll len(ll x){
	ll ret=0;
	while(x)ret++,x>>=1;
	return ret;
}

void solve(int k){
	int cnt=0,Max=0;
	if(!b.size()||!k)return;
	for(auto x:b){
		int now_len=len(x);
		if(now_len==Max)cnt++;
		else if(now_len>Max)Max=now_len,cnt=1;
	}
	if(Max==0){
		sum=sum*power(k,b.size()-k)%mod;
		return;
	}
	if(k==1){
		ll tmp=-1;
		for(auto x:b){
			if(tmp==-1)tmp=x;
			else tmp&=x;
		}
		ans+=tmp;
		return;
	}
	if(cnt==k){
		for(auto x:b)ans+=x;
		sum=sum*f[k]%mod;
		return;
	}
	if(cnt==b.size()){
		for(auto &x:b)x-=(1<<(Max-1));
		ans+=k*(1<<(Max-1));
		solve(k);
		return;
	}
	if(cnt<k){
		c.clear();
		for(auto x:b){
			if(x>=(1<<(Max-1)))ans+=x;
			else c.push_back(x);
		}
		sum=sum*f[k]%mod*incf[k-cnt]%mod;
		b=c;
		solve(k-cnt);
		return;
	}else{
		c.clear();
		ll tmp=-1;
		for(auto x:b){
			if(x>=(1<<(Max-1)))c.push_back(x-(1<<(Max-1)));
			else{
				if(tmp==-1)tmp=x;
				else tmp&=x;
			}
		}
		c.push_back(tmp);
		ans+=(k-1)*(1<<(Max-1));
		b=c;
		solve(k);
		return;
	}
}

int main(){
	pre_work(N-1);
	// double st=clock();
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]),b.push_back(a[i]);
	solve(m);
	printf("%lld %lld\n",ans,sum);
	// double ed=clock();
	// printf("%lf\n",ed-st);
	return 0;
}