#include<bits/stdc++.h>
#define rep(x,y,z) for(int x=y;x<=z;x++)
#define drep(x,y,z) for(int x=y;x>=z;x--)
#define ull unsigned long long
#define ll long long
using namespace std;
inline int read()
{
	int x=0;bool flag=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-')flag=0;ch=getchar();}
	while(ch>='0'&&ch<='9') {x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
	if(flag) return x;
	return ~(x-1);
} 
inline void write(int x)
{
	if(x<0) {x=~(x-1);putchar('-');}
	if(x>9) write(x/10);
	putchar(x%10+'0');
}
////////////////////////
ll nc,m,k;
struct G
{
    ll p;
    char f;
}n[1050];
ll b[5];
ll ans;
int main()
{
    freopen("holiday_and_angryF.in","r",stdin);
	freopen("holiday_and_angryF.out","w",stdout);
    cin>>nc>>m>>k;
    rep(i,1,nc) 
    {
        n[i].p=read(),cin>>n[i].f;
        if(n[i].f=='+') b[1]+=n[i].p;
        if(n[i].f=='-') b[2]+=n[i].p;
        if(n[i].f=='*') b[3]+=n[i].p;
        if(n[i].f=='/') b[4]+=n[i].p;
    }
    ans=max(b[2]*b[3]*b[4]-b[1]*b[4],b[3]*b[4]-b[1]);
    ans+=k;
    if(ans>m*b[2]) cout<<"YES\n";
    else cout<<"NO\n";
    cout<<ans/b[2]<<endl;
    return 0;
}