#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}




void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N,K;
	cin>>N>>K;
	vector<vector<bool>> p(N+1,vector<bool>(K+1));
	auto q=p;
	vector<int> A(N);
	rep(i,N) cin>>A[i];
	p[0][0]=1;
	q[N][0]=1;
	rep(i,N){
		p[i+1]=p[i];
		rep(j,K-A[i]+1){
			if(p[i][j]) p[i+1][j+A[i]]=1;
		}
	}
	for(int i=N;i>0;i--){
		q[i-1]=q[i];
		rep(j,K-A[i-1]+1){
			if(q[i][j]) q[i-1][j+A[i-1]]=1;
		}
	}
	if(!p[N][K]){
		cout<<"-1\n";
		return ;
	}
	vector<int> ans;
	rep(i,N){
		int J=1;
		rep(j,K+1){
			if(p[i][j]&&q[i+1][K-j]){
				J=0;
				break;
			}
		}
		if(J) ans.push_back(i+1);
	}
	cout<<ans.size()<<"\n";
}