#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::Read;

#[allow(dead_code)]
fn getline() -> String {
    let mut ret = String::new();
    std::io::stdin().read_line(&mut ret).ok().unwrap();
    ret
}

fn get_word() -> String {
    let stdin = std::io::stdin();
    let mut stdin=stdin.lock();
    let mut u8b: [u8; 1] = [0];
    loop {
        let mut buf: Vec<u8> = Vec::with_capacity(16);
        loop {
            let res = stdin.read(&mut u8b);
            if res.unwrap_or(0) == 0 || u8b[0] <= b' ' {
                break;
            } else {
                buf.push(u8b[0]);
            }
        }
        if buf.len() >= 1 {
            let ret = String::from_utf8(buf).unwrap();
            return ret;
        }
    }
}

#[allow(dead_code)]
fn get<T: std::str::FromStr>() -> T { get_word().parse().ok().unwrap() }

fn dfs(n: usize, last: usize, k: usize, memo: &mut HashMap<(usize, usize, usize), bool>) -> bool {
    let key = (n, last, k);
    if let Some(&val) = memo.get(&key) {
        return val;
    }
    let mut ans = false;
    for i in 1..min(n, k + 1) {
        if i == last { continue; }
        let opp = dfs(n - i, i, k, memo);
        if !opp {
            ans = true;
            break;
        }
    }
    memo.insert(key, ans);
    ans
}

fn solve() {
    let n: usize = get();
    let k: usize = get();
    let mut know = vec![vec![]; n + 1];
    for i in 1..n + 1 {
        let l = know[i].len();
        if l == 0 {
            for j in 1..min(n - i, k) + 1 {
                know[i + j].push(j);
            }
        } else if l == 1 {
            let j = know[i][0];
            if i + j <= n {
                know[i + j].push(j);
            }
        }
    }
    let mut seen = false;
    for i in 1..min(n, k + 1) {
        let l = know[n - i].len();
        if l == 0 || (l == 1 && know[n - i][0] == i) {
            println!("{}", i);
            seen = true;
        }
    }
    if !seen {
        println!("0");
    }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}