#include<bits/stdc++.h> using namespace std; int n,m,a[101]; void dfs(int r,int k) { if(r==m) { cout<<"yes"; exit(0); } int i=k; while(r+a[i]<=m) dfs(r+a[i++],k+1); } int main() { cin>>n>>m; for(int i=1;i<=n;i++) cin>>a[i]; dfs(0,1); cout<<"no"; return 0; }