def stones(n, a, b):
    finals = []
    for first in range(n):
        finals.append(first * max(a, b) + (n - first - 1) * min(a, b))
    return sorted(list(set(finals)))