Problem: Given 2 integers u and v, find the shortest array such that [bitwise-xor](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) of its elements is u, and the sum of its elements is v.

Input

The only line contains 2 integers u and v (0 ≤ u,v ≤ 10^{18}).

Output

If there's no array that satisfies the condition, print "-1". Otherwise:

The first line should contain one integer, n, representing the length of the desired array. The next line should contain n positive integers, the array itself. If there are multiple possible answers, print any.

Examples

Input


2 4


Output


2
3 1

Input


1 3


Output


3
1 1 1

Input


8 5


Output


-1

Input


0 0


Output


0

Note

In the first sample, 3⊕ 1 = 2 and 3 + 1 = 4. There is no valid array of smaller length.

Notice that in the fourth sample the array is empty.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e15;
const long long MOD = 1e9 + 7;
const long long v4i[4] = {-1, 0, 0, 1}, v4j[4] = {0, -1, 1, 0};
const long long v8i[8] = {-1, 0, 0, 1, 1, 1, -1, -1},
                v8j[8] = {0, -1, 1, 0, 1, -1, 1, -1};
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long u, v;
  cin >> u >> v;
  if (u % 2 != v % 2 || u > v) {
    cout << "-1\n";
    return 0;
  }
  if (u == v) {
    if (!u)
      cout << "0\n";
    else
      cout << "1\n" << u << "\n";
    return 0;
  }
  long long x = (v - u) >> 1;
  if (x < 0)
    cout << "-1\n";
  else if (!(u & x))
    cout << "2\n" << (u ^ x) << " " << x;
  else
    cout << "3\n" << u << " " << x << " " << x;
}