#include <bits/stdc++.h>
using namespace std;
#define int long long
#define MAXN 100001
#define MAXK 31
const int MOD(1e9+7);

int n, k, mxn, res(1), res2;
int fac[MAXN];
vector<int> a;

int qpow(int x, int k=MOD-2){
	int res(1); for (; k; k>>=1, (x *= x) %= MOD) if (k & 1) (res *= x) %= MOD;
	return res;
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cin >> n >> k;
	fac[0] = 1; for (int i(1); i<=n; ++i) fac[i] = (fac[i-1] * i) % MOD;
	for (int i(1), x; i<=n; ++i){cin >> x; a.push_back(x);}
	for (int i(MAXK-1), cnt; ~i; --i){
		cnt = 0; for (auto j: a) if ((j>>i) & 1) ++cnt;
		if (cnt < k){
			vector<int> tmp;
			for (auto j: a){
				if (!((j>>i) & 1)) tmp.push_back(j);
				else mxn += j;
			}
			a = tmp; (res *= (fac[k]*qpow(fac[k-cnt])) % MOD) %= MOD; k -= cnt;
		}else if (cnt == a.size()){mxn += k * (1<<i); for (auto &j: a) j ^= (1<<i);}
		else{
			mxn += (k-1) * mxn;
			vector<int> tmp; int now((1ll<<MAXK)-1);
			for (auto j: a){
				if ((j>>i) & 1) tmp.push_back(j ^ (1<<i));
				else now &= j;
			}
			tmp.push_back(now); a = tmp;
		}
	}
	for (int i(0); i<=k; ++i){
		int ans((((k-i) & 1 ? -qpow(i, a.size()) : qpow(i, a.size()))+MOD) % MOD);
		(res2 += (ans*qpow(fac[i]))%MOD*qpow(fac[k-i])) %= MOD;
	}
	// cout << res2 << ' ' << k << ' ' << a.size() << ' ' << res << '\n';

	cout << mxn << ' ' << (res2*res)%MOD;

	return 0;
}