#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;

ll T,A,B;

ll gcd(ll a,ll b){
  return b==0?a:gcd(b,a%b);
}

int main(){
  cin>>T>>A>>B;

  ll ans=(T-1)/A+(T-1)/B;
  ans++;

  ll C=gcd(A,B);
  B/=C;

  vector<ll> p(19,0);
  ll R=A;
  int last=0;
  for(int i=0;i<=18;i++){
    p[i]=R%10;
    R/=10;
    if(p[i]>0) last=i;
  }

  ll ret=0;
  for(int i=0;i<=last;i++){
    if(ret>=T){
      ret=T+1;
      break;
    }
    ll res=B;
    for(int j=0;j<i;j++){
      if(res>=T){
        res=-1;
        break;
      }
      res*=10;
    }

    if(res==-1){
      ret=T+1;
      break;
    }
    ll a=res*p[i];
    if(ret<=T&&a<=T) ret+=a;
    else{
      ret=T+1;
      break;
    }
  }

  //cout<<ans<<endl;

  ans-=(T-1)/ret;
  cout<<ans<<endl;

  return 0;
}