Problem:
Score : 1200 points

Problem Statement

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.

Sample Input 1

2 2
5 7

Sample Output 1

6

There are six possible combinations of integers on the blackboard: (1, 1), (1, 2), (2, 3), (3, 5), (4, 6) and (5, 7).
For example, (1, 2) can be obtained by performing Operation A and Operation B in this order.

Sample Input 2

3 4
10 13 22

Sample Output 2

20

Sample Input 3

1 100
10

Sample Output 3

11

Sample Input 4

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

Sample Output 4

164286011

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>
#define mod 1000000007
#define N 2010
#define inf 2000000000000000000ll
#define int long long
#define MI map<vector<ll>,vector<pair<ll,ll> > > :: iterator
using namespace std;
typedef long long ll;
inline int read()
{
	int x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1; ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}
	return x*f;
}
struct sp{ll B,C;}F[N];
map <vector<ll> ,vector<pair<ll,ll> > > M;
vector<pair<ll,ll> > tmp;
vector<ll> ttp;
ll n,k,A[N],G[N],t1[90],t2[90];
inline bool cmp(const sp a,const sp b)
{
	return a.C<b.C;
}
inline ll getpop(ll L,ll R)
{
	if(L==R) return __builtin_popcount(L);
	for(int i=0;i<=61;i++)
		if((L>>i)==(R>>i))
		{
			if(L%(1ll<<i))
				return __builtin_popcount(((L>>i)<<i))+1;
			return __builtin_popcount((L>>i)<<i);
		}
	return 0;
}
void print(vector <ll> V)
{
	for(int i=0;i<(int)V.size();i++)
		printf("%lld ",V[i]); printf("\n");
}
inline void acquire(int x)
{
	for(int i=1;i<=n;i++)
	{
		F[i].B=A[i]/(1ll<<x); 
		F[i].C=A[i]%(1ll<<x);
	}
	F[0].C=-1;
	sort(F+1,F+1+n,cmp); 
	F[n+1].C=(1<<x)-1;
	for(int i=1;i<=n+1;i++) if(F[i-1].C<F[i].C)
	{
		ttp.clear();
		ll bs=getpop(F[i-1].C+1,F[i].C),R=inf;
		for(int j=1;j<i;j++)
			if(F[j].B-1<0) return ;
			else ttp.push_back(F[j].B-1);
		for(int j=i;j<=n;j++)
			ttp.push_back(F[j].B);
		sort(ttp.begin(),ttp.end());
		ll lef=k-x-bs; R=ttp[0];
		if(lef<0) return ;
		for(int i=0;i<(int)ttp.size()-1;i++)
			ttp[i]=ttp[i+1]-ttp[i];
		ttp[ttp.size()-1]=0;
		M[ttp].push_back(make_pair(max(0ll,R-lef),R));
	}
}
signed main()
{
	n=read(); k=read(); for(int i=1;i<=n;i++)
		A[i]=read();
	for(int i=0;i<=60;i++)
		acquire(i);
	ll Ans=0;
	for(MI it=M.begin();it!=M.end();it++)
	{
		tmp=it->second;
		sort(tmp.begin(),tmp.end());
		ll nl=0,nr=-1;
		for(int i=0;i<(int)tmp.size();i++)
		{
			if(tmp[i].first>nr)
				Ans+=(nr-nl+1),nl=tmp[i].first;
			nr=max(nr,tmp[i].second);
		}
		Ans+=(nr-nl+1);
	}
	cout << Ans%mod << endl;
	return 0;
}