# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>

using namespace std;
int p,n,k;
int s=0;
int main()
{
    cin>>p>>n>>k;
    for(int i=1;i<=n;i++)
    {
        s=s+i*k;
    }
    if(p>=s) cout<<"Yes";
    else {cout<<"NO"<<'\n';
    cout<<s-p;}
    return 0;
}


# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>

using namespace std;
int n,x,res=0,t=2;
bool nt( int x)
{
    if(x<2) return false;
    for(int i=2;i*i<=x;i++)
        if(x%i==0) return false;
    return true;
}
int main()
{
    cin>>n;
    for(int i=2;i<=n;i++)

        {if(nt(t)==true)
            while(i%t==0)
             {   res=res+1;
               i=i/t;}
               cout<<res<<" ";
               res=0;
               t++;}


    return 0;
}

# data[].attributes.attachment_link.readable_text

#include <bits/stdc++.h>

using namespace std;
bool snt(int n)
{
    if(n<2)
        return false;
    if(n<6)
        return true;
    for(int i=2;i*i<=n;i++)
        if(n%i==0)
            {return false;
             break;}
    return true;
}
int n,b=0;
int main()
{
    cin>>n;
    if(snt(n)==true)
        {while(n!=0
               )
    {
        b=b*10+n%10;
        n=n/10;
    }
        if(snt(b)==true)
            cout<<1;
        else cout<<0;
         }
    else cout<<0;
    return 0;
}

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>

using namespace std;
int n;
int a[100001];
bool snt(int x)
{
    if(x==1) return false;
    for(int i=2;i*i<=n;i++)
    if(x%i==0) return false;
    return true;
}
bool scp(int x)
{
    int y=sqrt(x);
    if(y*y!=x)
        return false;
     return true;
}
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    for(int i=1;i<=n;i++)
         {if(scp(a[i])==true&&snt(sqrt(a[i]))==true)
           cout<<"skibididomdom YES"<<'\n';
          if(scp(a[i])==false||snt(sqrt(a[i]))==false)
            cout<<"NO"<<'\n';}

    return 0;
}

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>

using namespace std;
int n,a,b;
bool snt (int n){
if(n<2) return false;
if(n>2) {
    for(int i=2;i*i<=n;i++)
        if(n%i==0) return false;

}
else return true;
}
bool ssnt (int n){
while(n!=0){
    if(snt(n)==true) n=n/10;

    else {return false;
    break;}
}
return true;
}
int main()
{
    cin>>a>>b;
    for(int i=a;i<=b;i++)
        if(ssnt(i)==true)
    cout<<i<<'\n';
    return 0;
}

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>4

using namespace std;
int m,n,a,b;
int UCLN(int m,int n )
{
    int a;
    while(n>0){
        a=m%n;
        m=n;
        n=a;}
        return m;

}


int main()
{
    cin>>m>>n ;
   a=m/UCLN(m,n);
   b=n/UCLN(m,n);
    cout<<UCLN(m,n)<<" "<<a<<" "<<b;

    return 0;
}


# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>
bool kt=false;
bool ktnt(int n)
{
    if(n==1) return false;
    if(n<4) return true;
    for(int i=2;i*i<=n;i++)
        if(n%i==0) return false;
    return true;
}
using namespace std;
int n,m;
int main()
{
    cin>>n>>m;
    for(int i=n;i<=m;i++)
    {
        while(i!=0)
    {
        if(ktnt(i)==true)
        {kt=true;
        n=n/10;}
        else kt=false;
        break;
        }
        if(kt==true)  cout<<i<<" ";
    }
     return 0;
}


# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>

using namespace std;
int n,res=0,x,i;
int main()
{
  cin>>n;
  for(i=5;i<=n;i=i+5)
  {x=i;
      while(x%5==0)
      {
          res=res+1;
          x=x/5;
      }
  }
  cout<<res;
    return 0;
}


# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>

using namespace std;
int n;
int main()
{
    cin>>n;
    cout<<n/2;
    return 0;
}



# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>

using namespace std;
bool kt(int n)
{
    if(n<2)
        return false;
    if(n<6)
        return true;
    for(int i=2;i*i<=n;i++)
        if(n%i==0)
            {return false;
             break;}
    return true;
}
int n,b=0;
int main()
{
    cin>>n;
    if(kt(n)==true)
        {while(n!=0
               )
    {
        b=b*10+n%10;
        n=n/10;
    }
        if(kt(b)==true)
            cout<<1;
        else cout<<0;
         }
    else cout<<0;
    return 0;
}

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>

using namespace std;

int main(){
long long n , t;

cin >> t;

while(t--){
cin>>n;

cout<<n/2<<endl;

}
return 0;}

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>

using namespace std;
int n, a=0;
int main()
{
    cin>>n;

    int i=5;
   for(int i=5;i<=n;i++)
   {
       int x=i;
       while(x%5==0)
       {
           a++;
           x=x/5;

       }
   }
    if(n<5) cout<<0;
    else cout<<a;
    return 0;
}

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>

using namespace std;
int a, b;
int main()
{
    cin>>a>>b;

    int ma=0,mb=0;
    for (int i=1;i<=a/2;i++) {
        if (a%i==0) {
            ma=ma+i;
        }
    }
    for (int i=2;i<=b/2;i++) {
        if (b%i==0) {
            mb=mb+i;
        }
    }
    if (ma==b||mb==a) {
        cout<<"chucbanmaymanlannay";
    } else {
        cout<<"chucbanmaymanlansau";
    }

    return 0;
}

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>

using namespace std;
int n;
int d=0;
int a[1000];
 bool snt(int n){
if(n<2) return false;
if(n>2){
    for(int i=2;i*i<=n;i++)
        if(n%i==0)
        return false;

}
return true;
}

int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    cin>>a[i];
    for(int i=1;i<=n;i++)
    {for(int j=i+1;j<=n;j++)
       if(snt(a[i]+a[j])==true)
        d++;
    }
    cout<<d;
    return 0;
}

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>

using namespace std;
int ucln,bcnn,m,n;

int main()
{
  cin>>m>>n;
   ucln = __gcd(m,n);
   bcnn = m*n/ucln;

cout<<ucln<<" "<<bcnn;

}


# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>

using namespace std;
int a;
long long s,t,n;
int main()
{
    cin>>n;
    s=0;
    t=1;
    while(n>0){
    a=t%2;
     s=s+t*a;
     n=n/2;
    t=t*10;
    }
    cout<<s;
    return 0;
}


# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>

using namespace std;
long long n,s;
int a;
int main()
{
  cin>>n;
    s=0;
   while(n>0){
     a=n%10;
    s=s*10+a;
     n=n/10;
    }
  cout<<s;
    return 0;
}


# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>

using namespace std;
string st;
bool check(string s)
{ if (s.size()<8){return false;}
  else{ for(int i=0;i<=s.size();i++)
        {if(s[i]!=s[i+1]) return true;
        else {return false; break;}
        if(65<=s[i]<=90) return true;
        else {return false; break;}
        if(97<=s[i]<=122) return true;
        else {return false; break;}
        if(48<=s[i]<=57) return true;
        else {return false; break;}
        if(33<=s[i]<=43) return true;
        else {return false; break;}}}
}
int main()
{
    getline(cin,st);
    if(check(st)==true) cout<<"Yes";
    else cout<<"No";
    return 0;
}

# data[].attributes.attachment_link.readable_text


#include <bits/stdc++.h>
using namespace std;
int n,a[10000],i,d=0;
bool snt(int a[]){
if(n<2) return false;
if(n>2){
    for(int i=2;i*i<=n;i++)
        if(n%i==0)
        return false;
}
else return true;
}
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    cin>>a[i];
   for(int i=1;i<=n;i++)
{
    if(snt(a[i])==true)
    d++;
}
    cout<<d;
    return 0;
}

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>

using namespace std;
bool prime(int n) {
    for (int i=2; i<=sqrt(n); i++) if (n%i==0) return false;
    return n>=2;
}
int tong(int a, int b) {
    return a+b;
}
int main() {
    int n;
    cin >> n;
    int a[n];
    for (int i=0; i<n; i++) cin >> a[i];
    int d=0;
    for (int i=0; i<n-1; i++) for (int j=i+1; j<n; j++) {
        if (prime(tong(a[i],a[j]))==true) d++;
    }
    cout << d;
}

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin >> n;
    int a[n],ans=0;
    for (int i=0; i<n; i++) cin >> a[i];
    for (int i=1; i<n; i++)
         ans=max(a[i]+a[i-1]+a[i+1],ans);

    cout << ans;}

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>

using namespace std;

int main() {
    long long n;
    cin >> n;
    for (long long i = 2; i <= sqrt(n); i++) {
        int count = 0;
        while (n % i == 0) {
            count++;
            n /= i;
        }
        if (count > 0) {
            cout << i << " " << count << endl;
        }
    }
    if (n > 1) {
        cout << n << " " << 1 << endl;
    }
    return 0;
}

# data[].attributes.attachment_link.readable_text
#include <iostream>
#include <math.h>
using namespace std;
bool prime(int n) {
    for (int i=2; i<=sqrt(n); i++) if (n%i==0) return false;
    return n>=2;
}
int sum(int a, int b) {
    return a+b;
}
int main() {
    int n;
    cin >> n;
    int a[n];
    for (int i=0; i<n; i++)
        cin >> a[i];
    int d=0;
    for (int i=0; i<n-1; i++)
        for (int j=i+1; j<n; j++) {
        if (prime(sum(a[i],a[j]))==true)  d++;
    }
    cout << d;
}

# data[].attributes.attachment_link.readable_text
#include <iostream>

using namespace std;

int main()
{
    cout << "Hello world!" << endl;
    return 0;
}

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>
using namespace std;

string s;
int n,i;
bool k;
int main()
{
    cin>>s;
 n=s.length();
    k=true;
    for (i=0; i<=n-1; i++)
        if ((s[i]!='6')
            k=false;
    if (k==true)
        cout<<"YES";
    else cout<<"NO";
    return 0;
}
