Codeforces Round #456 (Div. 2)

A. Tricky Alchemy

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

During the winter holidays, the demand for Christmas balls is exceptionally high. Since it's already 2018, the advances in alchemy allow easy and efficient ball creation by utilizing magic crystals.

Grisha needs to obtain some yellow, green and blue balls. It's known that to produce a yellow ball one needs two yellow crystals, green — one yellow and one blue, and for a blue ball, three blue crystals are enough.

Right now there are A yellow and B blue crystals in Grisha's disposal. Find out how many additional crystals he should acquire in order to produce the required number of balls.

Input

The first line features two integers A and B (0 ≤ A, B ≤ 109), denoting the number of yellow and blue crystals respectively at Grisha's disposal.

The next line contains three integers x, y and z (0 ≤ x, y, z ≤ 109) — the respective amounts of yellow, green and blue balls to be obtained.

Output

Print a single integer — the minimum number of crystals that Grisha should acquire in addition.

Examples

input

4 3
2 1 1

output

2

input

3 9
1 1 3

output

1

input

12345678 87654321
43043751 1000000000 53798715

output

2147483648

Note

In the first sample case, Grisha needs five yellow and four blue crystals to create two yellow balls, one green ball, and one blue ball. To do that, Grisha needs to obtain two additional crystals: one yellow and one blue.

水题。

代码：

#include<iostream> 
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cmath>
#define inf 0x7f7f7f7f
#define maxn 100005
#define ll long long
#define mod 1000000007
using namespace std;
int main(){
	ll a,b;
	ll x,y,z;
	while(cin>>a>>b){
		ll ans;
		ll ans1;
		ll sum=0;
		cin>>x>>y>>z;
		ans=x*2+y;
		ans1=y+z*3;
		if(ans>a) sum+=ans-a;
		if(ans1>b) sum+=ans1-b; 
		cout<<sum<<endl;
	}
	return 0;
}

B. New Year's Eve

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Since Grisha behaved well last year, at New Year's Eve he was visited by Ded Moroz who brought an enormous bag of gifts with him! The bag contains n sweet candies from the good ol' bakery, each labeled from 1 to n corresponding to its tastiness. No two candies have the same tastiness.

The choice of candies has a direct effect on Grisha's happiness. One can assume that he should take the tastiest ones — but no, the holiday magic turns things upside down. It is the xor-sum of tastinesses that matters, not the ordinary sum!

A xor-sum of a sequence of integers a1, a2, ..., am is defined as the bitwise XOR of all its elements: , here denotes the bitwise XOR operation; more about bitwise XOR can be found here.

Ded Moroz warned Grisha he has more houses to visit, so Grisha can take no more than k candies from the bag. Help Grisha determine the largest xor-sum (largest xor-sum means maximum happiness!) he can obtain.

Input

The sole string contains two integers n and k (1 ≤ k ≤ n ≤ 1018).

Output

Output one number — the largest possible xor-sum.

Examples

input

4 3

output

7

input

6 6

output

7

Note

In the first sample case, one optimal answer is 1, 2 and 4, giving the xor-sum of 7.

In the second sample case, one can, for example, take all six candies and obtain the xor-sum of 7.

思路:一直没搞明白。。。但是A了，大概是1-n求m个数使得异或最大

代码：

#include<iostream> 
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cmath>
#define inf 0x7f7f7f7f
#define maxn 100005
#define ll long long
#define mod 1000000007
using namespace std;
ll f[100],n,m;
int main()
{
    f[0]=1;
    for(int i=1;i<=62;i++)
    {
		f[i]=f[i-1]*2;
    }
    cin>>n>>m;
    if(m==1) 
	cout<<n<<endl;
    else
    {
        for(int i=62;i>=0;i--)
        {
            if(f[i]<=n)
            {
			cout<<f[i+1]-1<<endl;
			return 0;
			}
        }
    }
}