use std::collections::VecDeque;


fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();
    let mut k = String::new();
    std::io::stdin().read_line(&mut k).ok();
    let k: usize = k.trim().parse().unwrap();

    if k < 4 {
        println!("0");
        return;
    }
    let mut target = k;
    let mut factors = VecDeque::new();
    factors.push_back(1usize);
    for i in 2..=(k as f64).sqrt() as usize {
        let mut cnt = 0usize;
        while target % i == 0 {
            target /= i;
            cnt += 1;
        }
        if cnt > 0 {
            let base = (0..=cnt).map(|j| i.pow(j as u32)).collect::<Vec<_>>();
            let limit = factors.len();
            for _ in 0..limit {
                let val = factors.pop_front().unwrap();
                for &v in base.iter() {
                    factors.push_back(v * val);
                }
            }
        }
    }
    if target > 1 {
        factors.push_back(target);
        if target < k {
            factors.push_back(factors[factors.len()-1] * factors[factors.len()-2]);
        }
    }
    factors.pop_front();
    factors.pop_back();
    let mut result = 0usize;
    for &v in factors.iter() {
        let ac = v;
        let ac = if ac / 2 + ac % 2 > n { 0 } else if ac <= n { ac - 1 } else { 1 + n - (ac - n) };
        let bd = k / v;
        let bd = if bd / 2 + bd % 2 > n { 0 } else if bd <= n { bd - 1 } else { 1 + n - (bd - n) };
        result += ac * bd;
    }
    println!("{}", result);
}