You are given two integers n and k. You are asked to choose maximum number of distinct integers from 1 to n so that there is no subset of chosen numbers with sum equal to k.

A subset of a set is a set that can be obtained from initial one by removing some (possibly all or none) elements of it.

Input

The first line contains the number of test cases T (1 ≤ T ≤ 100).

Each of the next T lines contains two integers n and k (1 ≤ k ≤ n ≤ 1000) — the description of test cases.

Output

For each test case output two lines. In the first line output a single integer m — the number of chosen integers.

In the second line output m distinct integers from 1 to n — the chosen numbers.

If there are multiple answers, print any. You can print the numbers in any order.

Example

Input


3
3 2
5 3
1 1


Output


2
3 1 
3
4 5 2 
0
#include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1e+9 + 7;
const ll INF = LLONG_MAX;
const int N = (int)2e+6 + 8;
vector<int> v1;
void MAIN(int tc) {
  int a, b;
  cin >> a >> b;
  int c[a + 1];
  for (ll i = (0); i <= a; i++) {
    c[i] = 1;
  }
  c[b] = 0;
  if (b % 2 == 1) {
    for (ll i = (0); i <= b / 2; i++) {
      c[i] = 0;
    }
  } else {
    for (ll i = (0); i <= b / 2 - 1; i++) {
      c[i] = 0;
    }
  }
  for (ll i = (0); i <= a; i++) {
    if (c[i] == 1) {
      cout << i << " ";
    }
  }
  cout << "\n";
  ;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cout << fixed;
  cout << setprecision(10);
  int test_cases = 1;
  cin >> test_cases;
  for (int i = 1; i <= test_cases; i++) {
    MAIN(i);
  }
}
