5. 정다면체

# 정다면체

def run(N, M):
    a = [0] * (N + M + 1)
    for i in range(1, N + 1):
        for j in range(1, M + 1):
            a[i+j] += 1

    max_cnt, res = -1e9, []
    for i, cnt in enumerate(a):
        if cnt > max_cnt:  # 최대일때 숫자들
            max_cnt = cnt
            res = [i]
        elif cnt == max_cnt:
            res.append(i)

    return res


N, M = map(int, input().split())
ans = run(N, M)
[print(x, end=" ") for x in ans]