#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=105;
const int M=1e4+5;
int a[N];
bool dp[N][M];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n,s;
    cin>>n>>s;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    memset(dp,false,sizeof(dp));
    for(int i=0;i<=n;i++){
        dp[i][0]=true;
    }
    for(int i=1;i<=n;i++){
        for(int j=0;j<=s;j++){
            //n=100 =10^2, s=10^4
            //=> đpt là O(n*s)= O(10^2*10^4)=  O(10^6), không bị TLE
            dp[i][j]=dp[i-1][j];
            if(j>=a[i]){
                dp[i][j]=dp[i][j]||dp[i-1][j-a[i]];
            }
        }
    }
    if(dp[n][s]==true){
        cout<<"YES\n";
        int i=n,j=s;
        stack<int>trace;
        while(j>0){
        if(!dp[i-1][j]){
                trace.push(i);
                j-=a[i];
            }
            --i;
        }
        while(!trace.empty()){
            cout<<trace.top()<<" ";
            trace.pop();
        }
        return 0;
    }
    cout<<"NO";
    return 0;
}
//Author: Adjency