#include typedef long long ll; using namespace std; ll a,b,rs,p,A[20],n,P[20]; void dec(int x){ if(x == 0) return; dec(x/10); ++n; A[n]=x%10; } int main(){ ios_base::sync_with_stdio(0);cin.tie(0); cin >> a >> b; if(a>10) return cout << 0,0; b-=1; dec(b); P[0]=1; for(int i = 1;i<=n;i++) P[i] = P[i-1]*(10-a); for(int i = 1;i<=n;i++){ if(A[i] < a) return cout << rs,0; rs+=(A[i]-a+1)*P[n-i]; } cout << rs; }