#include<bits/stdc++.h> #define int long long using namespace std; const int N=8.4e6; int n,m,a[N],ans; int qpow(int x,int y) { if(y==0) { return 1; } int z=qpow(x,y/2); if(y%2) { return z*z*x; } else { return z*z; } } int yihuo(int x,int y) { int z=0,c=1; for(int i=0;i<=23;i++) { if((x%2==1&&y%2==0)||(x%2==0&&y%2==1)) { z+=c; } x/=2; y/=2; c*=2; } return z; } signed main() { //freopen("guidance1.in","r",stdin); //freopen("guidance.out","w",stdout); cin>>n>>m; for(int i=1;i<=n;i++) { cin>>a[i]; } for(int i=0;i<qpow(2,m);i++) { int cnt=1e18; for(int j=1;j<n;j++) { int k=j+1; cnt=min(abs(yihuo(a[j],i)-yihuo(a[k],i))+yihuo(a[j],a[k]),cnt); } ans=(ans+(i+1)*cnt); } cout<<ans; return 0; }