#include <bits/stdc++.h>
using namespace std;

long max(long a,long b){
    if(a<b){
        return b;
    }
    return a;
}

long min(long a,long b){
    if(a>b){
        return b;
    }
    return a;
}

long count(long N,long x){
    return max(0,min(N,x-1)-max(x-N,1)+1);
}

int main(){
    long N,K;
    scanf("%ld %ld",&N,&K);
    long c = 0;
    for(long i=1;i*i<=K;i++){
        if(K%i == 0) continue;
        if(K/i != i){
            c += 2*count(N,K/i)*count(N,i);
        } else {
            c += count(N,K/i)*count(N,i);
        }
    }
    printf("%ld",c);
}