CF811A.Vladik and Courtesy

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

At regular competition Vladik and Valera won $a$ and $b$ candies respectively. Vladik offered $1$ his candy to Valera. After that Valera gave Vladik $2$ his candies, so that no one thought that he was less generous. Vladik for same reason gave $3$ candies to Valera in next turn.

More formally, the guys take turns giving each other one candy more than they received in the previous turn.

This continued until the moment when one of them couldn’t give the right amount of candy. Candies, which guys got from each other, they don’t consider as their own. You need to know, who is the first who can’t give the right amount of candy.

输入格式

Single line of input data contains two space-separated integers $a$ , $b$ ( $1<=a,b<=10^{9}$ ) — number of Vladik and Valera candies respectively.

输出格式

Pring a single line "Vladik’’ in case, if Vladik first who can’t give right amount of candy, or "Valera’’ otherwise.

输入输出样例

输入#1
```
1 1
```
输出#1
```
Valera
```
输入#2
```
7 6
```
输出#2
```
Vladik
```

说明/提示

Illustration for first test case:

Illustration for second test case:

首页