Find Coins

def solve(m, coins):
    m = int(m)
    coins = sorted(map(int, str(coins).split(',')))
    coin_set = set(coins)
    for i, c in enumerate(coins):
        need = m - c
        if need != c and need in coin_set:
            print(f'{c} {need}')
            return
        elif need == c:
            # need two same
            if coins.count(c) >= 2:
                print(f'{c} {need}')
                return
    print('No Solution')