#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+5;
const int mod=1e9+7;

int a[N],fac[N],ifac[N];
int n,k;

int ksm(int a,int b){
    int res=1;
    while(b) {
        if(b&1) res=1ll*res*a%mod;
        a=1ll*a*a%mod,b>>=1;
    }
    return res;
}
int C(int n,int m){
    if(n<m||m<0)return 0;
    return 1ll*fac[n]*ifac[m]%mod*ifac[n-m]%mod;
}

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

    cin>>n>>k;
    for(int i=fac[0]=1;i<=k;++i) fac[i]=1ll*fac[i-1]*i%mod;
    ifac[k]=ksm(fac[k],mod-2);
    for(int i=k-1;i>=0;--i) ifac[i]=1ll*ifac[i+1]*(i+1)%mod;
    for(int i=1;i<=n;++i) cin>>a[i];
    
    int ans=0,way=1;
    for(int j=31;j>=0;--j) {
        int cnt=0;
        for(int i=1;i<=n;++i) cnt+=(a[i]>>j&1);

        if(cnt==n) {
            ans+=k*(1ll<<j);
            for(int i=1;i<=n;++i) a[i]^=(1ll<<j);
            continue;
        }

        if(cnt<k) {
            for(int i=1;i<=cnt;++i) 
                way=1ll*way*(k-i+1)%mod;

            int sz=0;
            for(int i=1;i<=n;++i)
                if(~a[i]>>j&1) a[++sz]=a[i];
                else ans+=a[i];
            n=sz;
            k-=cnt;
        } else {
            ans+=(k-1)*(1ll<<j);

            int nw=-1,sz=0;
            for(int i=1;i<=n;++i)
                if(~a[i]>>j&1) nw=nw==-1?a[i]:(nw&a[i]);
                else a[++sz]=a[i]^(1ll<<j);
            a[++sz]=nw,n=sz;
        }
    }
    int t=0;
    for(int i=1;i<=k;++i) {
        int val=1ll*ksm(i,n)*C(k,i)%mod;
        if((k-i)&1) t=(t-val+mod)%mod;
        else t=(t+val)%mod;
    }
    way=1ll*way*t%mod;

    cout<<ans<<" "<<way<<endl;
    return 0;
}