#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T,size_t n> ostream& operator<<(ostream &os, const array<T,n> &t) {
	os<<"{"; rep(i,n) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T,class U> ostream& operator<<(ostream &os, const tuple<S,T,U> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class S, class T,class U,class V> ostream& operator<<(ostream &os, const tuple<S,T,U,V> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
#undef _DEBUG
#ifdef _DEBUG
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
#else
#define out
#endif
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
const ll MOD=1e9+7;

int get(ll l, ll r){
	++l; ++r;
	int re=100;
	for(ll i=l;i<r; i+=i^(i&(i-1))) MN(re,__builtin_popcountll(i));
	return re;
}

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
	ll n,t;
	cin>>n>>t;
	vector<ll> a(n);
	rep(i,n) cin>>a[i];
	map<vector<ll>,map<ll,ll>> mp;
	auto hoge=[&](vector<ll> key,ll cost){
			sort(all(key));
			if(key[0]<0 || cost>t) return;
			vector<ll> ky(n-1);
			rep(i,n-1) ky[i]=key[i+1]-key[i];
			ll mn=max(0ll, key[0]-max(0ll,t-cost));
			++mp[ky][mn];
			--mp[ky][key[0]+1];
			out(key,ky,mn,cost,1);
	};
	rep(i,min(61ll,t+1)){
		const ll msk=(1ll<<i)-1;
		sort(all(a),[&](ll x,ll y){return (x&msk)<(y&msk);});
		reps(j,1,n)if((a[j-1]&msk) < (a[j]&msk)){
			int cost=i+get(a[j-1]&msk,a[j]&msk);
			vector<ll> key;
			rep(k,j) key.pb((a[k]>>i)-1);
			reps(k,j,n) key.pb((a[k]>>i));
			hoge(key,cost);
		}
		vector<ll> key;
		rep(k,n) key.pb(a[k]>>i);
		hoge(key,i);
	}
	ll re=0;
	for(auto p:mp){
		ll sum=0;
		ll prv=0;
		for(pll pr:p.Y){
			if(sum>0) re+=pr.X-prv;
			//if(sum>0) out(p.X,prv,pr.X,1);
			re%=MOD;
			sum+=pr.Y;
			prv=pr.X;
		}
	}
	cout<<re<<endl;
  return 0;
}


Measured memory_bytes: 17408