#include <bits/stdc++.h>
using namespace std;
#define _MACRO(_1, _2, _3, NAME, ...) NAME
#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define _rep(i,n) _repl(i,0,n)
#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)
#define mp make_pair
#define pb push_back
#define all(x) begin(x),end(x)
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
void _dbg(string){cerr<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cerr<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define MOD 1000000007

int n;
map<vector<long>,pair<long,long>> memo;
// 閉区間

void dfs(vector<long> &v, long k){
  vector<long> tv(n);
  rep(i,n) tv[i] = v[i] - v[0];
// dbg(v,tv,k);
  auto itr = memo.find(tv);
  if(itr == memo.end()){
    memo[tv] = {v[0], max(0L, v[0]-k)};
  } else {
    pair<long,long> pr = itr->second;
    pair<long,long> cr = {v[0], max(0L, v[0]-k)};
    if(max(pr.se, cr.se) > min(pr.fi, cr.fi)) assert(false);
    if(pr.se > cr.se) assert(false);
    return;
  }

  if(all_of(all(v), [](long x){return x==0;})) return;

  if(k>=1){
    rep(i,n) tv[i] = v[i]/2;
    dfs(tv, k-1);
  }
  if(k>=2 && all_of(all(v), [](long x){return x>0;})){
    rep(i,n) tv[i] = (v[i]-1)/2;
    dfs(tv, k-2);
  }//dbg(memo.size());
}

int main(){
  long k;
  cin>>n>>k;
  vector<long> a(n);
  rep(i,n) cin>>a[i];
  sort(all(a));

  dfs(a, k);

  long ans = 0;
  for(auto &p : memo) ans += (p.se.fi - p.se.se +1)%MOD;

  cout << ans %MOD << endl;

  return 0;
}
