#include<map>
#include<queue>
#include<cmath> 
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define R register
#define ll long long
#define inf 707406378

inline void in(ll &x) {
    static ll ch; static bool flag;
    for(flag = false,ch = getchar();ch < '0'||ch > '9';ch = getchar()) flag |= ch == '-';
    for(x = 0;isdigit(ch);ch = getchar()) x = (x<<1) + (x<<3) + ch - '0';
    x = flag ? -x : x;
}

inline void write(int x){
    if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+'0');
}

ll m,s,t;
ll f[300005][4]; 

inline int dy(){
	
	freopen("escape.in","r",stdin);
	freopen("escape.out","w",stdout);
	
	in(m),in(s),in(t);
	f[0][0]=m;
	for(ll i=1;i<=t;++i){
		if(f[i-1][0]>=10)
			f[i][0]=f[i-1][0]-10,f[i][1]=f[i-1][1]+60;
		else f[i][0]=f[i-1][0]+4,f[i][1]=f[i-1][1];
		if(f[i-1][2]+17>f[i][1])f[i][2]=f[i-1][2]+17;
		else f[i][2]=f[i][1];
		if(f[i][2]>=s){printf("Yes\n%lld",i);exit(0);}
	}
	printf("No\n%lld",f[t][2]);
}

int QAQ = dy();

int main(){;}