拼多多第k大的数有人过了吗

tmp = input().split(',')
L = list(map(int,tmp[:-1]))
L_1,N = map(int,tmp[-1].split(';'))
L.append(L_1)
odd = []
even = []
for i in L:
    if i % 2 == 0:
        even.append(i)
    else:
        odd.append(i)
odd.sort(reverse=True)
even.sort(reverse=True)
res = []
for i in range(N):
    if even:
        res.append(str(even.pop(0)))
    else:
        res.append(str(odd.pop(0)))
print(','.join(res))

S = int(input())
def backtrace(i,now,op,res):
    if i == N:
        if not now and res == xiaobai:
            out.append(op)
        return
    backtrace(i+1,now[1:],op+['d'],res)
    backtrace(i+1,now[1:],op+['l'],[now[0]]+res)
    backtrace(i+1,now[1:],op+['r'],res+[now[0]])
for i in range(S):
    xiaomei = list(map(int, list(input())))
    xiaobai = list(map(int, list(input())))
    N = len(xiaomei)
    out = []
    backtrace(0,xiaomei,[],[])
    out.sort()
    print('{')
    for k in out:
        print(' '.join(k))
    print('}')