Anti-knapsack

题意翻译

### 题目描述 给定两正整数 $n$，$k$，从 $1$ 到 $n$ 中选取最多的不相同的数使得这些数构成的集合不存在元素之和为 $k$ 的子集。 ### 输入格式 第一行数据组数 $T$（$1\le T\le 100$）。 接下来的 $T$ 行每行两个正整数 $n$ 和 $k$，满足 $1\le k\le n\le 1000$。 ### 输出格式 对于每组数据输出两行，第一行一个整数 $m$ 描述选出来的数的个数，第二行 $m$ 个正整数描述你选出来的这些数 translated by @YangTY

题目描述

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.

输入输出格式

输入格式

The first line contains the number of test cases $ T $ ( $ 1 \le T \le 100 $ ). Each of the next $ T $ lines contains two integers $ n $ and $ k $ ( $ 1 \le k \le n \le 1000 $ ) — the description of test cases.

输出格式

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.

输入输出样例

输入样例 #1

3
3 2
5 3
1 1

输出样例 #1

2
3 1 
3
4 5 2 
0