#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
void chmin(T &a,T b){if(a>b)a=b;}
template<typename T>
void chmax(T &a,T b){if(a<b)a=b;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
ostream &operator<<(ostream &os, pair<ll, ll>&p){
  return os << p.first << " " << p.second;
}  
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  //cout<<fixed<<setprecision(10);
  ll res=0,buf=0;
  bool judge = true;
  ll n,x,d;cin>>n>>x>>d;
  if(d==0){
    ans(x==0,1,n+1);
    return 0;
  }
  map<ll,vector<ll>>mp;
  rep(i,0,n+1){
    ll tmp=1;
    while(x*i+tmp*abs(d)<0)tmp*=10;
    mp[(x*i+abs(d)*tmp)%abs(d)].push_back(i);
  }
  judge=false;
  auto sigl=[](ll k){
    return k*(k+1)/2;
  };
  auto sigr=[&](ll k){
    return sigl(n-1)-sigl(n-k-1);
  };
  ll sum=(x+x+d*(n-1))*n/2;
  ll sumd;
  {
    ll tmp=1;
    while(sum+tmp*d<0)tmp*=10;
    sumd=(sum+d*tmp)%d;
  }
  for(auto v:mp){
    ll l=INF,r=INF;
    for(auto k:v.se){
      //cout<<res spa v.fi spa k<<endl;
      ll lnow=min(sigl(k-1),sigr(k))+(k*x-v.fi)/d;
      ll rnow=max(sigl(k-1),sigr(k))+(k*x-v.fi)/d;
      //cout<<k spa l spa r spa lnow spa rnow  spa sigl(k-1) spa sigr(k)<<endl;
      //cout<<res<<endl;
      //cout<<l spa r spa lnow spa rnow<<endl;
      /*if(sumd%2==0&&v.fi==sumd&&
        ((k*x+lnow*d<=sumd/2&&k*x+rnow*d>=sumd/2)||
         (k*x+lnow*d>=sumd/2&&k*x+rnow*d<=sumd/2)))judge=false;*/
      if(r<lnow||l>rnow){
        res+=rnow-lnow+1;
        l=lnow,r=rnow;
      }
      else if(l<=lnow&&r>=rnow);
      else if(l>=lnow&&r<=rnow){
        res+=l-lnow+rnow-r;
        l=lnow;r=rnow;
      }
      else if(l>=lnow){
        res+=l-lnow;
        l=lnow;
      }
      else{
        res+=rnow-r;
        r=rnow;
      }
    }
  }
  cout<<res<<endl;
  return 0;
}

Measured memory_bytes: 22144