#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#define mod 998244353
using namespace std;
int n,k,a[200005];
vector<int> c[35];
int popc(int x){
    int ans=0;
    while(x)ans++,x>>=1;
    return ans;
}
int sum(){
    int ans=0;
    for (int i=0;i<=30;i++)
        for (int j=0;j<(int)c[i].size();j++)
            ans=(ans+c[i][j])%mod;
    return ans;
}
int Qpow(int a,int p){
    if (p==0)return 1;
    int t=Qpow(a,p/2);
    t=1ll*t*t%mod;
    if (p&1)t=1ll*t*a%mod;
    return t;
}
int main(){
    cin>>n>>k;
    for (int i=1;i<=n;i++)scanf("%d",&a[i]),c[popc(a[i])].push_back(a[i]);
    for (int i=1;i<30;i++){
        sort(c[i].begin(),c[i].end());
        if (k==0)continue;
        for (int j=0;j<(int)c[i].size();j++){
            c[i+1].push_back(c[i][j]*2);
            c[i][j]=0;
            k--;
            if (k==0)break;
        }
    }
    int ans=0;
    if (k==0)ans=sum();
    else{
        sort(c[30].begin(),c[30].end());
        int l=c[30].size();
        for (int i=0;i<l;i++){
            int t=k/l;
            if (i<k%l)t++;
            ans=(ans+1ll*c[30][i]*Qpow(2,t)%mod)%mod;
        }
    }
    cout<<ans<<endl;
    return 0;
}