use proconio::input;

fn main() {
    input! {
        (n, i): (usize, usize),
    }

    let mut nn = vec![];
    let mut rem = n;
    for j in (1..=i).rev() {
        if rem == 0 {
            break;
        }

        let sub_n = find_max_n(rem, j);
        nn.push(sub_n);
        rem -= calc_combinations(sub_n, j);
    }

    println!(
        "{}",
        nn.iter()
            .map(|n| n.to_string())
            .collect::<Vec<_>>()
            .join(" ")
    );
}

/// Calculates the number of combinations that select `k` elements from `n` elements.
pub fn calc_combinations(n: usize, k: usize) -> usize {
    if k > n {
        return 0;
    }

    let k = k.min(n - k);
    let mut ret = 1;
    for i in 0..k {
        ret *= n - i;
        ret /= i + 1;
    }

    ret
}

fn find_max_n(rem: usize, i: usize) -> usize {
    (i..)
        .take_while(|&j| calc_combinations(j, i) <= rem)
        .last()
        .unwrap()
}