Please hepl me to make this code consume less time

help
1

import itertools

def find_permutation(n, k):
l1 = list(range(1, n + 1))
l = list(itertools.permutations(l1))

for i in range(len(l) - 1):
    count = 0
    for j in range(len(l[i]) - 1):
        num = l[i][j] + l[i][j + 1]
        if num % 2 != 0:
            count += 1
    if count == k:
        return list(l[i])

t = int(input())
for _ in range(t):
n, k = map(int, input().split())
result = find_permutation(n, k)
print(" ".join(map(str, result)))