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

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#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;}
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;
} 
template<typename T>
struct Segments{
  set<pair<T,T>>data;
  T len;
  Segments(){
    len = 0;
  };
  Segments(T l,T r){ //半開区間を推奨
    data.emplace(make_pair(l,r));
    len = r - l;
  }
  void unite(const Segments &segments){
    for(auto seg:segments.data){
      auto itr = data.lower_bound(seg);
      T lmin = seg.first, rmax = seg.second;
      if(itr != data.begin()){
        auto itr2 = prev(itr,1);
        if(itr2->second >= seg.first){
          chmin(lmin, itr2->first);
          chmax(rmax, itr2->second);
          len -= itr2->second - itr2->first;
          data.erase(itr2);
        }
      }
      while(itr != data.end()){
        if(itr->first <= seg.second){
          chmin(lmin, itr->first);
          chmax(rmax, itr->second);
          len -= itr->second - itr->first;
          itr = data.erase(itr);
        }
        else break;
      }
      data.emplace(lmin, rmax);
      len += rmax - lmin;
    }
  }
  void unite(T l,T r){
    unite(Segments<T>(l, r));
  }
  Segments operator+(const Segments segments)const {
    this->unite(segments);
    return this;
  }
  Segments operator*(const Segments &segments)const {
    auto itr1 = this->data.begin();
    auto itr2 = segments.data.begin();
    Segments<T> ret;
    while(itr1 != this->data.end() && itr2 != segments.data.end()){
      T mi = max(itr1->first, itr2->first);
      T mx = min(itr1->second, itr2->second);
      if(mi < mx){
        ret.unite(Segments<T>(mi, mx));
      }
      if(itr1->second < itr2->second)itr1++;
      else itr2++;
    }
    return ret;
  }
  Segments intersect(T l,T r){
    return *this * Segments<T>(l, r);
  }
  void operator*=(const Segments &segments){
    *this = *this * segments; 
  }
};
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){
    Segments<ll>seg;
    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+1;
      seg.unite(lnow,rnow);
    }
    res+=seg.len;
  }
  cout<<res<<endl;
  return 0;
}

Measured memory_bytes: 22144