#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const ll N = 5e5+5,mod = 1e9+7;
ll n,m,a[N],b[N],fac[N],inv[N];
ll qpow(ll a,ll p){
	ll res = 1;
	for(;p;p>>=1,a=a*a%mod) if(p&1) res = res*a%mod;
	return res; 
}
ll C(ll n,ll m){
	return fac[n]*inv[m]%mod*inv[n-m]%mod;
}
int main(){
	cin.tie(0),cout.tie(0);
	ios::sync_with_stdio(0);
	cin >> n >> m;
	for(int i=1;i<=n;i++) cin >> a[i];
	fac[0] = 1;
	for(int i=1;i<=m;i++) fac[i] = fac[i-1]*i%mod;
	inv[m] = qpow(fac[m],mod-2);
	for(int i=m-1;i>=0;i--) inv[i] = inv[i+1]*(i+1)%mod;
	sort(a+1,a+1+n);
	ll L = log2(a[n]),ans = 0,tot = 1;
	for(int k=L;k>=0;k--){
		ll cnt = 0;
		for(int i=1;i<=n;i++) if(a[i]&(1<<k)) cnt++;
		if(!cnt) continue;
		if(cnt == n){
			ans += (1ll<<k)*m;
			for(int i=1;i<=n;i++) a[i] -= (1<<k);
			continue; 
		}
		if(cnt >= m){
			ans += (1ll<<k)*(m-1);
			ll t = 0,val = (1<<(L+1))-1;
			for(int i=1;i<=n;i++) {
				if(a[i]&(1<<k)) continue;
				val &= a[i];
			}
			for(int i=1;i<=n;i++){
				if(a[i]&(1<<k)) b[++t] = a[i]-(1<<k);
			}
			b[++t] = val,n = t;
			for(int i=1;i<=n;i++) a[i] = b[i];
		}else{
			for(int i=1;i<=n;i++) if(a[i]&(1<<k)) ans += a[i];
			tot = tot*C(m,cnt)%mod*fac[cnt]%mod,m -= cnt;
			int t = 0;
			for(int i=1;i<=n;i++){
				if(a[i]&(1<<k)) continue;
				b[++t] = a[i];
			}	
			n = t;
			for(int i=1;i<=n;i++) a[i] = b[i];
		}
	}
	if(n && m && n>=m) tot = tot*C(n-1,m-1)%mod*fac[m]%mod;
	cout << ans << ' ' << tot << '\n';
	return 0;
}