#include<bits/stdc++.h>
#define int long long
#define vint vector<int>
#define Pii pair<int,int>
const int mod=1e9+7;
const int QWQ=1e5+5;
using namespace std;
inline int read(){
	int x=0,f=1; char ch=getchar();
	for (;ch<'0'||ch>'9';ch=getchar())
		if (ch=='-') f=-1;
	for (;ch>='0'&&ch<='9';ch=getchar())
		x=(x<<1)+(x<<3)+(ch^48);
	return x*f;
}
int fac[QWQ],inv[QWQ];
int n,K; vint a,A,B;
inline int kkk(int a,int b){
	int ret=1;
	for (;b;b>>=1,a=a*a%mod)
		if (b&1) ret=ret*a%mod;
	return ret;
}
inline void init(int N){
	fac[0]=1;
	for (int i=1;i<=N;i++)
		fac[i]=fac[i-1]*i%mod;
	inv[N]=kkk(fac[N],mod-2);
	for (int i=N;i>=1;i--)
		inv[i-1]=inv[i]*i%mod;
} 
inline int C(int n,int m){
	if (n<m) return 0;
	return fac[n]*inv[n-m]%mod*inv[m]%mod;
}
int get(vint a,int len){
	int ret=a[0];
	for (int i=1;i<len;i++)
		ret&=a[i];
	return ret;
}
int sum(vint a){
	int ret=0;
	for (int u:a) ret+=u;
	return ret;
}
Pii work(vint a,int k){
//	for (int u:a) printf("%d ",u); puts("");
	int h=-1; A.clear(),B.clear();
	for (int u:a) if (u) h=max(h,__lg(u));
	if (!~h){
		int ret=0;
		for (int i=0;i<=k;i++){
			int val=C(k,i)*kkk(i,n)%mod;
			ret=(ret+((k-i)&1 ? mod-val:val))%mod;
		}
		return {0,ret};
	}
	for (int u:a)
		if (u>=1<<h) A.push_back(u);
		else B.push_back(u);
	int sA=A.size(),sB=B.size();
	if (sA==a.size()){
		for (int &u:A) u-=1<<h; Pii ret=work(A,k);
		return {ret.first+k*(1<<h),ret.second};
	}
	if (sA>=k){
		for (int &u:A) u-=1<<h; 
		int g=get(B,sB); A.push_back(g);
		Pii ret=work(A,k);
		return {ret.first+(k-1)*(1<<h),ret.second};
	}
	int g=sum(A); Pii ret=work(B,k-sA);
	return {ret.first+g,ret.second*C(k,sA)%mod*fac[sA]%mod};
}
signed main(){
	n=read(),K=read(),init(n);
	for (int i=1,x;i<=n;i++)
		a.push_back(x=read());
	Pii ret=work(a,K);
	printf("%lld %lld",ret.first,ret.second);
	return 0;
}