Absolute permutation

1def absolutePermutation(n, k):
2  # Write your code here
3  if k == 0:
4    return [str(i) for i in range(1, n + 1)]
5  else:
6    if n % k == 0 and (n // k) % 2 == 0:
7      a = [0 for _ in range(n)]
8        
9      for cl in range(n // (2 * k)):
10        for i in range(k):
11          a[i + 2 * k * cl] = 2 * k * cl + i + k
12          a[i + 2 * k * cl + k] = i + 2 * k * cl
13      return [str(x + 1) for x in a]
14    else:
15      return [-1]