#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
using ll = long long;
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define show(x) true
#endif

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);
	
	int N,X; cin >> N >> X;
	V<int> a(N); rep(i,N) cin >> a[i];
		const ll inf = 1e10;
	{
		ll A = 1;
		rep(i,N){
			A *= a[i] + 1;
			chmin(A,inf);
		}
		A--;
		if(A > X){
			cout << string(N,'0') << endl;
			return 0;
		}
	}
	sort(all(a));
	V<bool> res(X+1);
	set<V<int>> done;
	function<bool(V<int>)> dfs = [&](V<int> a){
		ll A = 1;
		rep(i,N){
			A *= a[i]+1;
			if(A >= inf) return true;
		}
		A--;
		if(A > X){
			return true;	//OVER
		}
		if((int)a.size() == 1){
			res[a[0]] = true;
			return false;
		}
		if(done.count(a)) return false;
		done.insert(a);

		int N = a.size();
		rep(i,N) for(int j=i+1;j<N;j++){
			bool SBREAK = false;
			rep1(s,1000000){
				rep1(t,1000000){
					V<int> na;
					rep(k,N) if(k!=i && k!=j) na.pb(a[k]);
					na.pb(a[i]*a[j]+s*a[i]+t*a[j]);
					sort(all(na));
					if(dfs(na)){
						if(t == 1) SBREAK = true;
						break;
					}
				}
				if(SBREAK) break;
			}
		}
		return false;
	};
	dfs(a);
	string s(X,'0');
	rep1(i,X) if(res[i]) s[i-1] = '1';
	cout << s << endl;
}