#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
    char c[32],z[32];
    long long p,q,a,b,mult,i,pmem,qmem,out=0;
    cin>>a>>b>>p>>q;
    pmem=p;
    qmem=q;
    mult=a/p;
    bool fail;
    for(;q<b;p=pmem*mult,q=qmem*mult)
    {
        sprintf(c,"%lld",p);
        sprintf(z,"%lld",q);
        sort(c,c+strlen(c));
        sort(z,z+strlen(z));
        fail=false;
        for(i=0;i<strlen(c);i++)
        {
            if(c[i]!=z[i]){ fail=true; break;}
        }
        if(!fail)
        {
            out++;
        }
        mult++;
    }
    cout<<out<<'\n';
    return 0;
}