Problem: There are N non-negative integers written on the blackboard: A_1, ..., A_N.

Snuke can perform the following two operations at most K times in total in any order:

* Operation A: Replace each integer X on the blackboard with X divided by 2, rounded down to the nearest integer.
* Operation B: Replace each integer X on the blackboard with X minus 1. This operation cannot be performed if one or more 0s are written on the blackboard.



Find the number of the different possible combinations of integers written on the blackboard after Snuke performs the operations, modulo 1,000,000,007.

Constraints

* 1 \leq N \leq 200
* 1 \leq A_i \leq 10^{18}
* 1 \leq K \leq 10^{18}
* A_i and K are integers.

Input

Input is given from Standard Input in the following format:


N K
A_1 A_2 ... A_N


Output

Print the number of the different possible combinations of integers written on the blackboard after Snuke performs the operations, modulo 1,000,000,007.

Examples

Input

2 2
5 7


Output

6


Input

3 4
10 13 22


Output

20


Input

1 100
10


Output

11


Input

10 123456789012345678
228344079825412349 478465001534875275 398048921164061989 329102208281783917 779698519704384319 617456682030809556 561259383338846380 254083246422083141 458181156833851984 502254767369499613


Output

164286011

Solution (in CPP):

Solution:
//2018-1-19
//miaomiao
//
#include <bits/stdc++.h>
using namespace std;

#define LL long long
#define pb push_back
#define For(i, a, b) for(int i = (a); i <= (int)(b); ++i)
#define Forr(i, a, b) for(int i = (a); i >= (int)(b); --i)

#define N (200+5)
#define LOG (60+5)

const int P = 1e9 + 7;

struct node{
	LL b, c;
	bool operator <(const node &rhs)const{return c < rhs.c;}
}h[N];

struct Seg{
	LL l, r;
	bool operator <(const Seg &rhs)const{return l < rhs.l;}
};

int n, m;
LL a[N], num[N];

struct lnode{
	LL l[N];

	bool operator <(const lnode &rhs)const{
		For(i, 1, n)
			if(l[i] < rhs.l[i]) return true;
			else if(l[i] > rhs.l[i]) return false;
		return false;
	}
};

map<lnode, int> ms;
vector<Seg> seg[N*LOG];

int Calc(LL L, LL R){
	LL tmp;
	int tot = 0;

	--L;
	Forr(i, 60, 0){
		tmp = 1ll<<i;
		if(R & tmp) ++tot;
		if((L&tmp) ^ (R&tmp)) return tot;
	}
	return __builtin_popcount(R);
}

lnode now;
void Put(int p, LL rem){
	For(i, 1, p-1){
		num[i] = h[i].b - 1; if(!h[i].b) return;
	}
	For(i, p, n) num[i] = h[i].b;
	sort(num+1, num+n+1);

	LL tmp = num[1];
	For(i, 1, n) now.l[i] = num[i] - tmp;
	if(!ms.count(now)) ms[now] = ++m;
	
	seg[ms[now]].pb((Seg){tmp-min(rem, tmp), tmp});
}

void Solve(){
	LL ans = 0, nl, nr, tot;

	For(si, 1, m){
		sort(seg[si].begin(), seg[si].end());

		tot = 0;
		nl = seg[si][0].l, nr = seg[si][0].r;

		For(i, 1, seg[si].size()-1){
			if(seg[si][i].l > nr){
				tot += nr - nl + 1;
				nl = seg[si][i].l; nr = seg[si][i].r;
			}else nr = max(nr, seg[si][i].r);
		}
		tot += nr - nl + 1;

		ans = (ans + tot%P) % P;
	}

	printf("%lld\n", ans);
}

int main(){
	LL s, tmp, rem;

	scanf("%d%lld", &n, &s);
	For(i, 1, n) scanf("%lld", &a[i]);
	
	For(k, 0, 60){
		tmp = 1ll << k;
		For(i, 1, n){
			h[i].b = a[i]/tmp, h[i].c = a[i]-h[i].b*tmp;
		}
		if(s < k) break;

		sort(h+1, h+n+1);
		
		Put(1, s-k);
		For(i, 2, n) if(h[i-1].c+1 <= h[i].c){
			rem = s - k - Calc(h[i-1].c+1, h[i].c);
			if(rem >= 0) Put(i, rem);
		}
	}

	Solve();

	return 0;
}