4194: 分糖游戏

内存限制:256 MB 时间限制:1 S
题面:传统 评测方式:文本比较 上传者:
提交:3 通过:3

题目描述

Vladik 和 Valera 分别有a,b颗糖,从 Vladik开始,第一轮Vladik给Valera 1颗他的糖,Valera 给 Vladik 2颗,也就是每人给对方的糖数会以2递增,问谁的糖最先无法按该规律给予对方

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.
Input
Single line of input data contains two space-separated integers a, b (1≤a,b≤109) − number of Vladik and Valera candies respectively.
Output
Pring a single line "Vladik’’ in case, if Vladik first who can’t give right amount of candy, or "Valera’’ otherwise.
Examples
Input
1 1
Output
Valera
Input
7 6
Output
Vladik

输入格式

单行输入数据包含两个空格分隔的整数a,b(1≤a,b≤10^9)分别为Vladik和Valera糖果。

输出格式

输出一行 “Vladik”,以防万一Vladik第一个给不了多少糖果,或者“Valera”。

输入

1 1

输出

Valera

输入

7 6

输出

Vladik

输入样例 复制

1 1

输出样例 复制

Valera

数据范围与提示

每个人每次要给对方的糖数都会增2

模拟过程,直到出现有一个人无法完成给糖