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 GCC optimize("Ofast")
using namespace std;
void yes() {
  cout << "YES\n";
  return;
}
void no() {
  cout << "NO\n";
  return;
}
template <class T>
void out(T temp) {
  cout << temp << endl;
  return;
}
void out(double temp) {
  cout << setprecision(7) << fixed << temp << endl;
  return;
}
void out(long double temp) {
  cout << setprecision(7) << fixed << temp << endl;
  return;
}
void init() {}
void solve(int case_no) {
  int k, n;
  cin >> k >> n;
  vector<int> ans;
  for (int i = (k + 1) / 2; i < k; i++) ans.push_back(i);
  for (int i = k + 1; i <= n; i++) ans.push_back(i);
  out(ans.size());
  for (int i : ans) cout << i << " ";
  cout << endl;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  srand(time(NULL));
  init();
  int t = 1;
  cin >> t;
  for (int i = 1; i <= t; i++) solve(i);
}
