def stones(n, a, b):
    # Write your code here
    x = [ sum(i) for i in combinations_with_replacement([a,b], n -1 )]
        
    return sorted(set(x))