use std::collections::BTreeSet;

fn main() {
    let mut input = String::new();
    std::io::stdin().read_line(&mut input).ok();
    let input: Vec<u64> = input
        .split_whitespace()
        .map(|n| n.parse().unwrap())
        .collect();

    let mut answer = BTreeSet::new();

    for n_five in 0..=input[1] {
        for n_one in 0..=input[0] {
            answer.insert(5 * n_five + n_one);
        }
    }

    answer.remove(&0);

    for &n in &answer {
        println!("{}", n);
    }
}