CF460D.Little Victor and Set

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Little Victor adores the sets theory. Let us remind you that a set is a group of numbers where all numbers are pairwise distinct. Today Victor wants to find a set of integers $S$ that has the following properties:

for all $x$ the following inequality holds $l<=x<=r$ ;
$1<=|S|<=k$ ;
lets denote the $i$ -th element of the set $S$ as $s_{i}$ ; value must be as small as possible.

Help Victor find the described set.

输入格式

The first line contains three space-separated integers $l,r,k$ $(1<=l<=r<=10^{12}; 1<=k<=min(10^{6},r-l+1))$ .

输出格式

Print the minimum possible value of $f(S)$ . Then print the cardinality of set $|S|$ . Then print the elements of the set in any order.

If there are multiple optimal sets, you can print any of them.

输入输出样例

输入#1
```
8 15 3
```
输出#1
```
1
2
10 11
```
输入#2
```
8 30 7
```
输出#2
```
0
5
14 9 28 11 16
```

说明/提示

Operation represents the operation of bitwise exclusive OR. In other words, it is the XOR operation.

首页