# coding: utf-8
import array, bisect, collections, copy, heapq, itertools, math, random, re, string, sys, time
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7


def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}


def read():
    A, B = ILI()
    return A, B


def solve(A, B):
    s_ans = set()
    for i in range(A + 1):
        for j in range(B + 1):
            if i == 0 and j == 0:
                continue
            s_ans.add(i + j * 5)
    ans = "\n".join(map(str, sorted(list(s_ans))))
    return ans


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()