#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,m;
    int num1,num2;
    while(~scanf("%d%d",&n,&m)){
        num1=0;num2=0;
        int t=n;
        for(int i=0;i<=t;i=i+2){
            if(n>=i+1){
            num1++;
            n=n-(i+1);
            }
            if(m>=i+2){
            num2++;
            m=m-(2+i);
           }
        }
        //cout<<num1<<" "<<num2<<endl;
        if(num1<=num2) printf("Vladik\n");
        else printf("Valera\n");
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,m;
    int num1,num2;
    while(~scanf("%d%d",&n,&m)){
        num1=0;num2=0;
        int t=n;
        for(int i=1;i<=t;i++){       //我的天呢，脑子离家出走了，我一开始写的i=0;i<=n，n会变的。〒▽〒
            if(n>=2*i-1){
            num1++;
            n-=2*i-1;
            }
            if(m>=2*i){
            num2++;
            m-=2*i;
            }
        }
        if(num1<=num2) printf("Vladik\n");
        else printf("Valera\n");
    }
    return 0;
}

Vladik had started reading a complicated book about algorithms containing n pages. To improve understanding of what is written, his friends advised him to read pages in some order given by permutation P?=?[p₁,?p₂,?...,?p_n], where p_i denotes the number of page that should be read i-th in turn.

Sometimes Vladik’s mom sorted some subsegment of permutation P from position l to position r inclusive, because she loves the order. For every of such sorting Vladik knows number x — what index of page in permutation he should read. He is wondered if the page, which he will read after sorting, has changed. In other words, has p_x changed? After every sorting Vladik return permutation to initial state, so you can assume that each sorting is independent from each other.

First line contains two space-separated integers n, m (1?≤?n,?m?≤?10⁴) — length of permutation and number of times Vladik‘s mom sorted some subsegment of the book.

Second line contains n space-separated integers p₁,?p₂,?...,?p_n (1?≤?p_i?≤?n) — permutation P. Note that elements in permutation are distinct.

Each of the next m lines contains three space-separated integers l_i, r_i, x_i (1?≤?l_i?≤?x_i?≤?r_i?≤?n) — left and right borders of sorted subsegment in i-th sorting and position that is interesting to Vladik.

For each mom’s sorting on it’s own line print "Yes", if page which is interesting to Vladik hasn‘t changed, or "No" otherwise.

Explanation of first test case:

1. [1,?2,?3,?4,?5] — permutation after sorting, 3-rd element hasn’t changed, so answer is "Yes".
2. [3,?4,?5,?2,?1] — permutation after sorting, 1-st element has changed, so answer is "No".
3. [5,?2,?3,?4,?1] — permutation after sorting, 3-rd element hasn’t changed, so answer is "Yes".
4. [5,?4,?3,?2,?1] — permutation after sorting, 4-th element hasn’t changed, so answer is "Yes".
5. [5,?1,?2,?3,?4] — permutation after sorting, 3-rd element has changed, so answer is "No".

#include<bits/stdc++.h>
using namespace std;
const int N=1e5;
int a[N];
int main(){
    int n,m;
    int h,k,l,num;
    while(~scanf("%d%d",&n,&m)){
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
        while(m--){
            scanf("%d%d%d",&h,&k,&l);
            num=0;
            for(int i=h-1;i<=k-1;i++){
                if(a[i]<a[l-1])
                num++;
            }
            if(num==l-h) printf("Yes\n");
            else printf("No\n");
        }
    }
    return 0;
}