#include<cstdio>
using namespace std;

long long a,b,n,d,x,y,oldn,oldd;
int br,k=1,lala,masiv[100];
bool f=0;

void rec (long long p, long long q)
{
    //printf("%lld %lld\n",p,q);
    k++;
    if (p>=b) return;
    if (a<=p)
    {
        x=p; y=q;
        lala=0;
        while (y)
        {
            masiv[lala]=y%10;
            y=y/10;
            lala++;
        }
        while (x)
        {
            lala--;
            if (x%10!=masiv[lala]) {f=1; break;}
            x=x/10;
        }
        if (f==0 && lala==0) br++; 
        f=0;
    }
    rec(oldn*k,oldd*k);
}

int main ()
{
    scanf ("%lld %lld %lld %lld",&a,&b,&n,&d);
    oldn=n; oldd=d;
    rec (n,d);
    printf ("%d",br);
    return 0;
}