#include<bits/stdc++.h>
using namespace std;
int n,m,k;
double ans;
struct node{
    int acnt;
    int bcnt;
    int c[1001];
    int cx;
    int d[1001];
    int dx;
}rec;
int main(){
    freopen("holiday_and_angryF.in","r",stdin);
    freopen("holiday_and_angryF.out","w",stdout);
    cin>>n>>m>>k;
    char a;
    int b;
    for(int i=1;i<=n;i++){
        cin>>a>>b;
        if(b=='+'){
            rec.acnt+=a;
        }
        if(b=='-'){
            rec.bcnt+=a;
        }
        if(b=='*'){
            rec.c[rec.cx]=a;
            rec.cx++;
        }
        if(b=='/'){
            rec.d[rec.dx]=a;
            rec.dx++;
        }
    }
    ans=k;
    for(int i=0;i<rec.dx;i++){
        ans/=rec.d[i];
    }
    ans+=rec.acnt;
    for(int i=0;i<rec.cx;i++){
        ans*=rec.c[i];
    }
    ans-=rec.bcnt;
    if(ans>m){
        cout<<"YES"<<endl;
    }
    else{
        cout<<"NO"<<endl;
    }
    cout<<ceil(ans)<<endl;
    return 0;
}