#include<bits/stdc++.h>
#define int long long 
using namespace std;

const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
int n, k, a[maxn];
int fac[maxn + 5], ifac[maxn + 5];

int qpow(int a, int b)
{
	int sum = 1;
	while(b)
	{
		if(b & 1) sum = sum * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return sum;
}

void init()
{
	fac[0] = 1;
	for(int i = 1; i <= maxn; i++) fac[i] = fac[i - 1] * i % mod;
	ifac[maxn] = qpow(fac[maxn], mod - 2);
	for(int i = maxn - 1; i >= 0; i--) ifac[i] = ifac[i + 1] * (i + 1) % mod;
}

int A(int x, int y)
{
	return fac[x] * ifac[x - y] % mod;
}

int C(int x, int y)
{
	return fac[x] * ifac[x - y] % mod * ifac[y] % mod;
}

signed main()
{
	ios::sync_with_stdio(false);
	cout.tie(0);
	cin.tie(0);
	
	init();
	cin >> n >> k;
	for(int i = 1; i <= n; i++) cin >> a[i];
	int r1 = 0, r2 = 1;
	for(int i = 30; i; i--)
	{
		int cnt = 0;
		for(int j = 1; j <= n; j++) if((a[j] >> i) & 1) cnt++;
		if(!cnt) continue;
		if(cnt < k)
		{
			r2 = r2 * A(k, cnt) % mod;
			k -= cnt;
			int x = 0;
			for(int j = 1; j <= n; j++)
			{
				if((a[j] >> i) & 1)
				{
					r1 += a[j];
				}
				else a[++x] = a[j];
			}
			n = x;
		}
		else
		{
			if(cnt == n)
			{
				r1 += k << i;
				for(int j = 1;j <= n; j++)
				{
					a[j] = a[j] ^ (1 << i);
				}
			}
			else
			{
				r1 += (k - 1) << i;
				int x = 0, y = (1 << i) - 1;
				for(int j = 1; j <= n; j++)
				{
					if((a[j] >> i) & 1) a[++x] = a[j] ^ (1 << i);
					else y &= a[j];
				}
				a[++x] = y;
				n = x;
			}
		}
	}
	int f = 0;
	for(int i = 1; i <= k; i++)
	{
		int g = qpow(i, n) * C(k, i) % mod;
		if((k - i) & 1) f -= g;
		else f += g;
	}
	cout << r1 << " " << ((f % mod + mod) % mod * r2) % mod;
	return 0;
}
/*
3 2
4 7 5


*/