#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int n,m,l,r;
long long ans;
int gcd(int x,int y){ return x==0?y:gcd(y%x,x); }
int main(){
    scanf("%d%d%d%d",&n,&m,&l,&r);
    if(l==1){ ans+=1ll*(n+1)*m+1ll*(m+1)*n; }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++){
            double Len=sqrt(i*i+j*j);
            if(Len<l||Len>r||gcd(i,j)!=1)    continue;
            ans+=2LL*(n-i+1)*(m-j+1);
        }
    cout<<ans;
}