#include<cstdio>

#include<algorithm>

#include<cstring>

#include<cmath>

#define rep(i,a,n) for(ll i = a;i <= n;i++)

#define per(i,n,a) for(ll i = n;i >= a;i--)

#define enter putchar('\n')

using namespace std;

const int M = ;

typedef long long ll;

int read()

{

    int ans = ,op = ;

    char ch = getchar();

    while(ch < '' || ch > '')

    {

        if(ch == '-') op = -;

        ch = getchar();

    }

    while(ch >= '' && ch <= '')

    {

        ans *= ;

        ans += ch - '';

        ch = getchar();

    }

    return ans * op;

}

int m,s,t,dp[M];

int main()

{

    m = read(),s = read(),t = read();

    rep(i,,t)

    {

        if(m >= ) m -= ,dp[i] = dp[i-] + ;

        else dp[i] = dp[i-],m += ;

    }

    rep(i,,t)

    {

        dp[i] = max(dp[i],dp[i-]+);

        if(dp[i] >= s)

        {

            printf("Yes\n%d\n",i);

            return ;

        }

    }

    printf("No\n%d\n",dp[t]);

    return ;

}