pub mod prime_factorization {
    pub fn prime_factorization(n: usize) -> std::collections::BTreeMap<usize, usize> {
        let mut res = std::collections::BTreeMap::<usize, usize>::new();
        if n < 2 {
            return res;
        }
        let mut rem = n;
        {
            let mut i = 2;
            while i * i <= rem {
                while rem % i == 0 {
                    *res.entry(i).or_insert(0) += 1;
                    rem /= i;
                }
                i += 1;
            }
        }
        if rem > 1 {
            *res.entry(rem).or_insert(0) += 1;
        }
        res
    }

    pub fn divisors(n: usize) -> Vec<usize> {
        let mut res = vec![];
        let mut i = 1;
        while i * i <= n {
            if n % i == 0 {
                res.push(i);
                let j = n / i;
                if i != j {
                    res.push(j);
                }
            }
            i += 1;
        }
        res.sort();
        res
    }
}

pub mod scanner {

    pub struct Scanner {
        buf: Vec<String>,
    }

    impl Scanner {
        pub fn new() -> Self {
            Self { buf: vec![] }
        }

        pub fn new_from(source: &str) -> Self {
            let source = String::from(source);
            let buf = Self::split(source);
            Self { buf }
        }

        pub fn next<T: std::str::FromStr>(&mut self) -> T {
            loop {
                if let Some(x) = self.buf.pop() {
                    return x.parse().ok().expect("");
                }
                let mut source = String::new();
                std::io::stdin().read_line(&mut source).expect("");
                self.buf = Self::split(source);
            }
        }

        fn split(source: String) -> Vec<String> {
            source
                .split_whitespace()
                .rev()
                .map(String::from)
                .collect::<Vec<_>>()
        }
    }
}

use crate::{prime_factorization::divisors, scanner::Scanner};
use std::io::Write;
fn main() {
    let mut scanner = Scanner::new();
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    let t: usize = 1;
    for _ in 0..t {
        solve(&mut scanner, &mut out);
    }
}
fn solve(scanner: &mut Scanner, out: &mut std::io::BufWriter<std::io::StdoutLock>) {
    let n: usize = scanner.next();
    let k: usize = scanner.next();
    let list = divisors(n - k);
    let mut ans = 0usize;
    for &a in list.iter() {
        if a > k {
            ans += 1;
        }
    }
    writeln!(out, "{}", ans).unwrap();
}