Problem: 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 <image> the following inequality holds l ≤ x ≤ r; 
  * 1 ≤ |S| ≤ k; 
  * lets denote the i-th element of the set S as si; value <image> must be as small as possible. 



Help Victor find the described set.

Input

The first line contains three space-separated integers l, r, k (1 ≤ l ≤ r ≤ 1012; 1 ≤ k ≤ min(106, r - l + 1)).

Output

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.

Examples

Input

8 15 3


Output

1
2
10 11


Input

8 30 7


Output

0
5
14 9 28 11 16

Note

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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long l, r, k;
  while (cin >> l >> r >> k) {
    if (l == r) {
      cout << l << endl;
      cout << 1 << endl;
      cout << l << endl;
    } else {
      if (k == 1) {
        cout << l << endl;
        cout << 1 << endl;
        cout << l << endl;
        continue;
      } else if (l + 1 == r) {
        if ((l ^ r) < l) {
          cout << (l ^ r) << endl;
          cout << 2 << endl;
          cout << l << " " << r << endl;
        } else {
          cout << l << endl;
          cout << 1 << endl;
          cout << l << endl;
        }
      } else if (l + 2 == r) {
        if (l == 1 && k > 2) {
          cout << 0 << endl;
          cout << 3 << endl;
          cout << "1 2 3" << endl;
        } else {
          if (l & 1) l++;
          cout << 1 << endl;
          cout << 2 << endl;
          cout << l << " " << l + 1 << endl;
        }
      } else {
        if (k == 3 || (k > 3 && l + 3 == r)) {
          bool find = false;
          long long t = 1;
          while (t <= l) t <<= 1;
          t += t / 2;
          if (t <= r) {
            cout << 0 << endl;
            cout << 3 << endl;
            cout << (t ^ (t - 1)) << " " << t << " " << t - 1 << endl;
            find = true;
          }
          if (find) continue;
        }
        if (k < 4 || (l + 3 == r && (l & 1))) {
          if (l & 1) l++;
          cout << 1 << endl;
          cout << 2 << endl;
          cout << l << " " << l + 1 << endl;
        } else {
          if (l & 1) l++;
          cout << 0 << endl;
          cout << 4 << endl;
          cout << l << " " << l + 1 << " " << l + 2 << " " << l + 3 << endl;
        }
      }
    }
  }
  return 0;
}