#include <bits/stdc++.h>
using namespace std;
const int maxn=1e6+14;
long long n, s, pre[maxn];
void solve(){
	cin >> n >> s;
	pre[0] = 0;
	unordered_map < long long , int > m;
	for (int i = 1; i <= n; i++){
		int x;
		cin >> x;
		pre[i] = pre[i - 1] + x;
        if (m[pre[i]] == 0)	m[pre[i]] = i;
	}
    
    m[0] = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < i; j++){
            if (pre[i] - pre[j] == s){
                cout << "YES" << endl << j + 1 << ".." << i ;
                return ;
            }
        }
    }
    
    cout << "NO";
	return;
}
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);    cout.tie(0);
    if (fopen("input.txt","r")){
        freopen("input.txt","r",stdin);
        freopen("output.txt","w",stdout);
    }
	solve();
	return 0;
}