[SWEA] 특별한 정렬

T = int(input())
for tc in range(T):
    N = int(input())
    arr = list(map(int, input().split()))

    for index in range(N):
        min_num = 99999
        max_num = -99999
        for i in range(index, N):
            if index % 2 == 0:          # 인덱스가 짝수
                if arr[i] > max_num:
                    max_num = arr[i]
                    found = i
            if index % 2 == 1:          # 인덱스가 홀수
                if arr[i] < min_num:
                    min_num = arr[i]
                    found = i

        arr[index], arr[found] = arr[found], arr[index]     # 선택정렬

    print('#{} '.format(tc+1), end = '')
    for i in range(10):
        print(arr[i], end = ' ')
    print('')