#include<bits/stdc++.h>
#define ll long long
#define R register
using namespace std;
const int N=1e5+5,mod=1e9+7;
ll n,k,a[N],res1,res2=1,mul[N],inv[N];
vector<int> v;
inline ll qmul(ll a,ll b){
	ll ans=1;
	while(b){
		if(b&1)ans=ans*a%mod;
		a=(a*a)%mod;b>>=1;
	}
	return ans;
}
inline void init(int _n){
	inv[0]=mul[0]=1;
	for(R int i=1;i<=_n;++i)mul[i]=mul[i-1]*i%mod;
	inv[_n]=qmul(mul[_n],mod-2);
	for(R int i=_n-1;i>=1;--i)inv[i]=inv[i+1]*(i+1)%mod;
}
inline ll C(ll a,ll b){
	if(a<b||b<0||a<0)return 0;
	return mul[a]*inv[b]%mod*inv[a-b]%mod;
}
inline void solve(int len,int cntk,int t){
	if(t<0||!len)return;
	vector<int> v1;int cnt=0;
	for(R int i=0;i<len;++i){
		v1.push_back(v.back());int kk=v.back();v.pop_back();
		if((kk>>t)&1)++cnt;
	}
	if(cnt==len){
		res1+=(1<<t)*(cntk);
		for(R int i=0;i<len;++i){
			int kk=v1.back();
			kk^=(1<<t);
			v.push_back(kk);
			v1.pop_back();
		}
	}else if(cnt<cntk){
		res2=(res2*mul[cntk]%mod*inv[cntk-cnt])%mod;
		for(R int i=0;i<len;++i){
			int kk=v1.back();v1.pop_back();
			if((kk>>t)&1){
				res1+=kk;--k,--cntk;
			}
			else v.emplace_back(kk);
		}
	}else{
		res1+=(1<<t)*(cntk-1);
		int res=0;bool fl=0;
		for(R int i=0;i<len;++i){
			int kk=v1.back();
			if((kk>>t)&1){
				kk^=(1<<t);
				v.push_back(kk);
			}else{
				if(!fl)fl=1,res=kk;
				else res&=kk;
			}
			v1.pop_back();
		}
		v.push_back(res);
	}
	solve(v.size(),cntk,t-1);
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
	cin>>n>>k;init(max(n,k));
	for(R int i=1;i<=n;++i)cin>>a[i],v.emplace_back(a[i]);
	solve(n,k,30);ll sum=0;
	for(R int i=0;i<=k;++i){
		ll kk=(i%2==0?1:mod-1)*C(k,i)%mod;
		sum=(sum+kk*qmul(k-i,v.size()))%mod;
	}
	res2=(res2*sum)%mod;
	cout<<res1<<' '<<res2<<'\n';
	return 0;
}