use std::collections::BTreeSet;


fn main() {
    let mut ab = String::new();
    std::io::stdin().read_line(&mut ab).ok();
    let ab: Vec<usize> = ab.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let a = ab[0];
    let b = ab[1];

    let mut result = BTreeSet::new();
    for i in 0..=a {
        for j in 0..=b {
            if i == 0 && j == 0 { continue; }
            result.insert(i+j*5);
        }
    }
    for &v in result.iter() {
        println!("{}", v);
    }
}