# Warm-up Equation

The brain is also a muscle, and it cannot be used without a warm-up, so we offer you a warm-up task (even without any legend).

You are given three integers $a$, $b$ and $g$, and the equation system:

Here, $âˆ£$ means bitwise OR operation.

Firstly, you need to calculate the number of non negative roots for this equation system. In other words, you need to find the number of distinct pairs $(Î±,Î²)$, such that $Î±+Î²=a$ and $Î±âˆ£Î²=b$. Please note that $(Î±,Î²)$ and $(Î²,Î±)$ are considered as distinct pairs (if $Î±î€=Î²$).

Secondly, you need to find the smallest possible distance between $x$ and $y$ (i.e., the smallest possible value of $âˆ£Î±âˆ’Î²âˆ£$ among all the roots) or $âˆ’1$ if there are no roots.

If $g=0$, then you have to output just the first answer. Otherwise, you need to output both answers.

## Input

The first and only line contains three integers $a,b,g$ $(1â‰¤a,bâ‰¤10_{18},0â‰¤gâ‰¤1).$

## Output

In the first line, output the number of positive roots for this equation system.

If $g=1$, then in the second line output the smallest distance between $x$ and $y$, or $âˆ’1$ if no solution exists. Otherwise, do not output anything in the second line.

## Examples

## Scoring

($8$ points): $a<b$;

($8$ points): $aâ‰¤10_{3},g=0$;

($4$ points): $aâ‰¤10_{3}$;

($11$ points): $aâ‰¤10_{6},g=0$;

($5$ points): $aâ‰¤10_{6}$;

($25$ points): $aâ‰¤10_{18},g=0$;

($14$ points): no additional constraints.