#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
    
const int l=1000;
int f[300001][l+11];
    
int main()
{
    int m,s,t;
    scanf("%d%d%d",&m,&s,&t);
    memset(f,-1,sizeof(f));
    f[0][m]=0;
    int maxs=0;
    for (int i=1;i<=t;i++)
        for (int j=0;j<=m;j++)
        {
            if (f[i-1][j]!=-1)
                f[i][j]=max(f[i][j],f[i-1][j]+17);
            if (j-4>=0)
                if (j<=l&&f[i-1][j-4]!=-1)
                    f[i][j]=max(f[i][j],f[i-1][j-4]);
            if (f[i-1][j+10]!=-1)
                f[i][j]=max(f[i][j],f[i-1][j+10]+60);
            if (f[i][j]>=s)
            {
                printf("%s\n","Yes");
                printf("%d\n",i);
                return 0;
            }
            else
                maxs=max(maxs,f[i][j]);
        }
    printf("%s\n","No");
    printf("%d\n",maxs);
    return 0;
}