#include <cstdio>
#include <algorithm>
using namespace std;
int a[25];
int n,k;
bool dfs(int x,int s) { //前x项,和s
if (x==n) return s==k; //***
if (dfs(x+1,s)) return true;
if (dfs(x+1,s+a[x])) return true;
return false;
}
int main()
{
scanf ("%d%d",&n,&k);
for (int i=1;i<=n;i++)
scanf ("%d",&a[i]);
if (dfs(0,0)) printf ("yes\n");
else printf ("no\n");
return 0;
}