Problem Statement:Captain America and Iron Man are at WAR and the rage inside Iron Man is rising.

But Iron Man faces a problem to identify the location of Captain America.

There are N buildings situtaed adjacently to each other and Captain America can be at any building.

Iron Man has to arrange the Buildings from 1 to N is such a way that Value(i.e abs(Building Number -Position of Building))=K for every building.

Can You help Iron Man to Find The Arrangement of the Buildings?

P.S- If no arrangement exist, then print         
“CAPTAIN AMERICA EVADES”.

Input Format:
The first line of input contains a single integer,T, denoting the number of test cases.

Each of the T  subsequent lines contains 2 space-separated integers describing the respective N and K values for a test case.

Output Format:
On a new line for each test case, 

Print the lexicographically smallest arrangement; 

If no absolute arrangement exists, print “CAPTAIN AMERICA EVADES”.

Constraints:
SubTask#1
1<=T<=10

1<=N<=10^5

0<=K<=N

SubTask#2
Original Constraints..

SubTask#3
Original Constraints..

Sample Input:
3

2 1

3 0

3 2

Sample Output:

2 1

1 2 3

CAPTAIN AMERICA EVADES

Explanation:
Case 1:

N=2 and K=1

Therefore the arrangement is [2,1].

Case 2:

N=3 and K=0

Therefore arrangement is [1,2,3].

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 't = int(input())\nwhile t> 0:\n t =t -1\n n,k = list(map(int,input().split()))\n a = [0]*n\n done = True\n\n def swap(z):\n  for j in range(0,n):\n   if a[j] == 0:\n    a[j] = z\n    done = True\n    break\n   else:\n    if a[j] > z:\n     swap(j)\n     a[j] = z\n    else:\n     done = False\n     break\n\n for i in range(0,n):\n  for j in range(0,n):\n   if abs(i-j) == k:\n    if a[j] == 0:\n     a[j] = i + 1\n     done = True\n     break\n    else:\n     if a[j] > i + 1:\n      swap(a[j])\n      a[j] = i + 1\n     else:\n      done = False\n\n if 0 in a:\n  print(\'CAPTAIN AMERICA EVADES\')\n else:\n  if done:\n   for c in a:\n    print(c, end=\' \')\n   print()\n  else:\n   print(\'CAPTAIN AMERICA EVADES\')\n\n\n # for i in range(1,n+1):\n #   if i - k >=0 :\n #       if a[abs(i-k-1)] == 0:\n #           a[abs(i-k-1)] = i\n #           done = True\n #       else:\n #           done = False\n #           break\n #   else:\n #       done = False\n #       break\n # if done:\n #   for c in a:\n #       print c,\n #   print\n # else:\n #   print "CAPTAIN AMERICA EVADES"\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 13275