'''
https://programmers.co.kr/learn/courses/30/lessons/12910
๋๋์ด ๋จ์ด์ง๋ ์ซ์ ๋ฐฐ์ด
[ํ์ด]
0. ๋๋จธ์ง๊ฐ 0 ์ธ ์ ์ฐพ๊ธฐ
1. divmod ์ฌ์ฉ
'''
def solution(arr, divisor):
answer = [i for i in sorted(arr) if divmod(i, divisor)[1] == 0]
return answer if len(answer) != 0 else [-1]
'''
๋ฐฐ์ธ ์ ์ด ์๋ ์ฝ๋
def solution(arr, divisor): return sorted([n for n in arr if n%divisor == 0]) or [-1]
len == 0 ์ ๋น๊ตํ ๋๋ if else ๋์ False or True ๋ฅผ ์ด์ฉํ ์ ์์
'''