Submission details
Task:Super knight
Sender:aalto26kw_005
Submission time:2026-11-18 17:17:08 +0200
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.01 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#23ACCEPTED0.00 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#28ACCEPTED0.00 sdetails
#29ACCEPTED0.00 sdetails
#30ACCEPTED0.00 sdetails
#31ACCEPTED0.00 sdetails
#32ACCEPTED0.00 sdetails
#33ACCEPTED0.00 sdetails
#34ACCEPTED0.00 sdetails
#35ACCEPTED0.00 sdetails
#36ACCEPTED0.00 sdetails
#37ACCEPTED0.00 sdetails
#38ACCEPTED0.00 sdetails
#39ACCEPTED0.00 sdetails
#40ACCEPTED0.00 sdetails
#41ACCEPTED0.00 sdetails
#42ACCEPTED0.00 sdetails
#43ACCEPTED0.00 sdetails
#44ACCEPTED0.00 sdetails
#45ACCEPTED0.00 sdetails
#46ACCEPTED0.01 sdetails
#47ACCEPTED0.00 sdetails
#48ACCEPTED0.01 sdetails
#49ACCEPTED0.01 sdetails
#50ACCEPTED0.01 sdetails
#51ACCEPTED0.01 sdetails
#52ACCEPTED0.01 sdetails
#53ACCEPTED0.01 sdetails
#54ACCEPTED0.01 sdetails
#55ACCEPTED0.01 sdetails
#56ACCEPTED0.01 sdetails
#57ACCEPTED0.01 sdetails
#58ACCEPTED0.01 sdetails
#59ACCEPTED0.01 sdetails
#60ACCEPTED0.01 sdetails
#61ACCEPTED0.01 sdetails
#62ACCEPTED0.01 sdetails
#63ACCEPTED0.01 sdetails
#64ACCEPTED0.01 sdetails
#65ACCEPTED0.01 sdetails
#660.66 sdetails
#670.65 sdetails
#68ACCEPTED0.01 sdetails
#690.66 sdetails
#700.65 sdetails
#710.70 sdetails
#720.69 sdetails
#730.70 sdetails
#740.70 sdetails
#750.70 sdetails

Code

#include <iostream>
#include <vector>
#include <functional>
#include <set>
#include <algorithm>
#include <stack>
#include <unordered_map>
#include <map>
#include <iomanip>
#include <limits>
#include <queue>
#include <math.h>
#include <bits/stdc++.h>
 
typedef long long LL;
typedef std::tuple<LL>          TUP1LL;
typedef std::tuple<LL,LL>       TUP2LL;
typedef std::tuple<LL,LL,LL>    TUP3LL;
typedef std::tuple<LL,LL,LL,LL> TUP4LL;

 
std::tuple<LL> readLL1(){
    LL a;
    std::cin >> a;
    return {a};
}

std::tuple<LL,LL> readLL2(){
    LL a, b;
    std::cin >> a >> b;
    return {a,b};
}

std::tuple<LL,LL,LL> readLL3(){
    LL a, b, c;
    std::cin >> a >> b >> c;
    return {a,b,c};
}
std::tuple<LL,LL,LL,LL> readLL4(){
    LL a, b, c, d;
    std::cin >> a >> b >> c >> d;
    return {a,b,c,d};
}
 
std::vector<LL> readVecLL(LL n){
    std::vector<LL> arr(n);
    for (LL i = 0; i < n; i++){
        LL a;
        std::cin >> a;
        arr[i] = a;
    }
    return arr;
}

std::string readStr(){
    std::string a;
    std::cin >> a;
    return a;
}

std::vector<std::string> readVecStr(LL n){
    std::vector<std::string> arr(n);
    for (LL i = 0; i < n; i++){
        std::string a;
        std::cin >> a;
        arr[i] = a;
    }
    return arr;
}
 
std::vector<std::tuple<LL,LL>> readVecTup2(LL n){
    std::vector<std::tuple<LL,LL>> arr(n);
    for (LL i = 0; i < n; i++){
        arr[i] = readLL2();
    }
    return arr;
}
 
std::vector<std::tuple<LL,LL,LL>> readVecTup3(LL n){
    std::vector<std::tuple<LL,LL,LL>> arr(n);
    for (LL i = 0; i < n; i++){
        arr[i] = readLL3();
    }
    return arr;
}
std::vector<std::tuple<double,double,double>> readVecTup3Dup(LL n){
    std::vector<std::tuple<double,double,double>> arr(n);
    for (LL i = 0; i < n; i++){
        double a, b, c;
        std::cin >> a;
        std::cin >> b;
        std::cin >> c;
        arr[i] = {a,b,c};
    }
    return arr;
}
std::vector<std::tuple<LL,LL,LL,LL>> readVecTup4(LL n){
    std::vector<std::tuple<LL,LL,LL,LL>> arr(n);
    for (LL i = 0; i < n; i++){
        arr[i] = readLL4();
    }
    return arr;
}
 
void printNewLine(){std::cout << "\n";}
template<typename T, typename... Ts>
std::tuple<Ts...> tail(std::tuple<T,Ts...> as){
    return std::apply([](T &a, Ts... b){return std::make_tuple(b...);},as);
}
 
template<typename T>
void print(T a){std::cout << std::setprecision(19) << a;}
template<typename... T>
void println(T... a);
 
template<typename T, typename Ts>
void print(std::tuple<T,Ts> a){
    print(std::get<0>(a));
    print(" ");
    print(std::get<1>(a));
}
 
template<typename T, typename... Ts>
void print(std::tuple<T,Ts...> a){
    print(std::get<0>(a));
    print(" ");
    print(tail(a));
}
 
template<typename T>
void print(const std::vector<T> &arr, LL width = -1){
    if (width == -1) width = arr.size();
    for (LL i = 0; i < (LL)arr.size(); i++){
        print(arr[i]);
        if (i+1 == (LL)arr.size()) continue;
        if ((i%width) == width-1) printNewLine();
        if ((i%width) != width-1) print(" ");
    }    
}
template<typename... T>
void println(T... a){print(a...);printNewLine();}
 
 
 
template<typename T>
void sorted(std::vector<T> &arr){
    std::sort(arr.begin(),arr.end(),[](const T &a, const T &b){ return a < b; });
}

template<typename T>
std::set<T> toSet(const std::vector<T> &vec){
    std::set<T> c;
    for (T a : vec){ c.emplace(a);}
    return c;
}
 
template<typename T, typename N>
std::vector<N> map(const std::vector<T> &a, const std::function<N(T)> &transform){
    std::vector<N> b(a.size());
    LL i = 0;
    for (T x : a){
        b[i] = transform(x);
        i++;
    }
    return b;
}
 
template<typename N, typename M, typename R>
std::vector<R> zip(const std::vector<N> &a, const  std::vector<M> &b, const std::function<R(N,M)> &transform){
    LL n = std::min(a.size(),b.size());
    std::vector<R> res(n);
    for (LL i = 0; i < n; i++){
        res[i] = transform(a[i],b[i]);
    }
    return res;
}
 
template<typename T, typename N>
std::vector<N> convertVec(const std::vector<T> &a){
    std::vector<N> b(a.size());
    LL i = 0;
    for (T x : a){
        b[i] = x;
        i++;
    }
    return b;
}

template<typename T>
std::vector<T> reverse(const std::vector<T> &a){
    std::vector<T> b(a.size());
    LL i = 0;
    for (T x : a){
        b[a.size()-1-i] = x;
        i++;
    }
    return b;
}

template<typename T, typename R>
R reduce(const std::vector<T> &arr, R init, const std::function<R(const R,const T)> &transform){
    R current = init;
    for (LL idx = 0; idx < (LL)arr.size(); idx++){
        current = transform(current,arr[idx]);
    };
    return current;
}
template<typename T>
T max(const std::vector<T> &arr){return reduce(arr, arr[0], static_cast<std::function<T(const T,const T)>>(static_cast<const T& (*)(const T&, const T&)>(std::max<T>)));}
template<typename T>
T min(const std::vector<T> &arr){return reduce(arr, arr[0], static_cast<std::function<T(const T,const T)>>(static_cast<const T& (*)(const T&, const T&)>(std::min<T>)));}

template<typename T>
std::function<T(const T,const T)> add(){return [](T a,T b){return a+b;};}
template<typename T>
std::function<T(const T,const T)> modAdd(T mod){return [mod](T a,T b){return (((a+b)%mod)+mod)%mod;};}
template<typename T, typename R>
std::function<R(const R,const T)> mulAdd(R mul){return [mul](R a,T b){return a+b*mul;};}
template<typename T>
T sum(const std::vector<T> &arr){return reduce(arr, 0, add<T>());}
template<typename T>
T avg(const std::vector<T> &arr){return reduce(arr, 0.0, mulAdd<double,T>(1.0/arr.size()));}

template<typename T>
T binarySearch(T min, T max, const std::function<bool(T)> &leq){
    if (min == max) return max;
    T guess = (min+max)/2;
    if (leq(guess)){
        return binarySearch(min,guess,leq);
    }else{
        return binarySearch(guess+1,max,leq);
    }
}

template<typename T>
T binarySearchDecending(T min, T max, const std::function<bool(T)> &leq){
    std::function<bool(T)> gt = [leq](T x){
        return !leq(x);
    };
    return binarySearch(min,max+1, gt)-1;
}

template<typename T>
std::vector<T> cloneVec(std::vector<T> a){return a;}

template<typename T>
std::vector<T> padding(const std::vector<T> &initial, T num, LL start, LL end){
    std::vector<T> arr(start+initial.size()+end);
    for (LL i = 0; i < start; i++){
        arr[i] = num;
    }
    for (LL i = 0; i < (LL)initial.size(); i++){
        arr[start+i] = initial[i];
    }
    for (LL i = 0; i < end; i++){
        arr[start+initial.size()+i] = num;
    }
    return arr;
}

template<typename T>
LL findMax(LL start, LL end, const std::function<T(LL)> &maxHeuristic){
    T initialGuess = maxHeuristic(start);
    LL index = start;
    for (LL i = start; i <= end; i++){
        if (initialGuess < maxHeuristic(i)){
            initialGuess = maxHeuristic(i);
            index = i;
        }
    }
    return index;
}

template<typename T>
void operateOnMax(LL start, LL end, const std::function<T(LL)> &maxHeuristic, const std::function<void(LL)> &found){
    found(findMax(start,end,maxHeuristic));
}

template<typename T>
void stackOperate(std::vector<T> init, const std::function<std::vector<T>(T)> operate){
    std::stack<T> stack;
    for (auto x : init){
        stack.push(x);
    }
    while (!stack.empty()){
        T next = stack.top();
        stack.pop();
        std::vector<T> nextSteps = operate(next);
        for (T a : nextSteps){
            stack.push(a);
        }
    }
}

template<typename T>
void queueOperate(std::vector<T> init, const std::function<std::vector<T>(T)> operate){
    std::queue<T> que;
    for (auto x : init){
        que.push(x);
    }
    while (!que.empty()){
        T next = que.front();
        que.pop();
        std::vector<T> nextSteps = operate(next);
        for (T a : nextSteps){
            que.push(a);
        }
    }
}

template<typename T>
void priorityQueueOperate(std::vector<T> init, const std::function<std::vector<T>(T)> operate){
    std::priority_queue<T> que;
    for (auto x : init){
        que.push(x);
    }
    while (!que.empty()){
        T next = que.top();
        que.pop();
        std::vector<T> nextSteps = operate(next);
        for (T a : nextSteps){
            que.push(a);
        }
    }
}
 
template<typename T>
void recursiveVectorSplit(LL start, LL end, LL distl, LL distr, const std::function<T(LL)> &maxHeuristic, const std::function<void(LL)> &found){
    if (start == end){
        return found(start);
    }else if (end < start){
        return;
    }
    std::tuple<LL,LL> range = {start,end};
    std::function<std::vector<std::tuple<LL,LL>>(std::tuple<LL,LL>)> splitter = [distl, distr,&maxHeuristic,&found](std::tuple<LL,LL> range){
        auto [start,end] = range;
        LL idx = findMax(start, end, maxHeuristic);
        found(idx);
        std::vector<std::tuple<LL,LL>> next;
        if (idx+distl+1 <= end){
            next.push_back({idx+distl+1,end});
        }
        if (start <= idx-distr-1){
            next.push_back({start, idx-distr-1});
        }
        return next;
    };
    stackOperate({range},splitter);
}
 
 
template<typename T>
std::vector<T> dynamicallyComputableList(LL n, std::function<T(std::vector<T>&,LL)> next){
    std::vector<T> arr(n);
    for (LL i = 0; i < n; i++){
        arr[i] = next(arr,i);
    }
    return arr;
}
template<typename T>
LL indexOfBinarySearch(const std::vector<T> &arr, const T &find){
    return binarySearch((LL)0,(LL)arr.size()-1,(std::function<bool(LL)>)[&arr, &find](LL guess){return find <= arr[guess];});
}

template<typename T>
std::unordered_map<T, LL> indexCompress(const std::vector<T> &arr){
    std::unordered_map<T, LL> compressed;
    LL i = 0;
    for (T x : arr){
        if (compressed.find(x) != compressed.end()) compressed[x] = i++;
    }
    return compressed;
}   

template<typename... Ts>
std::tuple<std::vector<std::tuple<LL,Ts...>>, std::vector<LL>> edgeIndexing(int n, std::vector<std::tuple<LL,Ts...>> edges){
    sorted(edges);
    std::vector<LL> edgeIndex(n+1);
    {
        LL j = 0;
        for (LL i = 0; i < (LL)edges.size(); i++) {
            auto a = std::get<0>(edges[i]);
            while (j <= a){
                edgeIndex[j++] = i;
            }
        }
        while (j < n){
            edgeIndex[j++] = edges.size();
        }
        edgeIndex[n] = edges.size(); 
    }
    return {edges,edgeIndex};
}


template<typename T>
std::tuple<std::vector<T>, std::vector<LL>> shortestPathDirected(const LL n, std::vector<std::tuple<LL, LL, T>> edgesInit, LL start){
    //assumes all paths are between 0 <= c < n
    //assumes 0 indexing
    std::vector<LL> path(n);
    std::vector<bool> edgeUpdated(n);
    std::vector<T> distance(n);
    for (LL i = 0; i < n; i++) path[i] = i;
    for (LL i = 0; i < n; i++) edgeUpdated[i] = true;
    edgeUpdated[start] = false;
    for (LL i = 0; i < n; i++) distance[i] = std::numeric_limits<T>::max()/4;
    distance[start] = 0;
    auto [edges,edgeIndex] = edgeIndexing(n,edgesInit);
    std::function<std::vector<std::tuple<LL,LL>>(std::tuple<LL,LL>)> func = [&distance,&edgeIndex,&edges,&path,&edgeUpdated](std::tuple<LL,LL> propagateW){
        auto& [weight,propagate] = propagateW;
        std::vector<std::tuple<LL,LL>> next;
        if (distance[propagate] != -weight) return next;
        if (edgeUpdated[propagate]) return next;
        for (LL i = edgeIndex[propagate]; i < edgeIndex[propagate+1]; i++){
            auto& [a, b, w] = edges[i];
            if (distance[a]+w < distance[b]){
            //if (std::min(distance[a],w) > distance[b]){
                next.push_back({-(distance[a]+w),b});
                //next.push_back({std::min(distance[a],w),b});
                distance[b] = std::min(distance[a],w);
                path[b] = a;
                edgeUpdated[b] = false;
            }
        }
        edgeUpdated[propagate] = true;
        return next;
    };
    priorityQueueOperate((std::vector<std::tuple<LL,LL>>){{0,start}},func);
    //for (LL i = 0; i < n; i++) {
    //    bool changed = false;
    //    for (auto& e : edges) {
    //        auto& [a, b, w] = e;
    //        if (!changed) {changed = (distance[b] != std::min(distance[b], distance[a]+w));}
    //        if (distance[a]+w < distance[b]){
    //            distance[b] = distance[a]+w;
    //            path[b] = a;
    //        }
    //    }
    //    if (!changed) break;
    //    if (changed && i == n){
    //        return std::tuple((std::vector<T>){},(std::vector<LL>){});
    //    }
    //}
    return std::tuple(distance,path);
}
 
std::vector<LL> pathFromPathMap(std::vector<LL> &map, LL goal){
    std::stack<LL> fullPath;
    fullPath.push(goal);
    while (map[fullPath.top()] != fullPath.top()){
        fullPath.push(map[fullPath.top()]);
    }
    std::vector<LL> p;
    while (!fullPath.empty()){
        p.push_back(fullPath.top());
        fullPath.pop();
    }
    return p;
}
 
 
template<typename T>
std::tuple<std::vector<T>, std::vector<LL>> shortestPath(const LL n, std::vector<std::tuple<LL, LL, T>> &edgesMessy, LL start){
    std::vector<std::tuple<LL, LL, T>> edges;
    for (auto e : edgesMessy){
        auto [a,b,t] = e;
        edges.push_back({a,b,t});
        edges.push_back({b,a,t});
    }
    return shortestPathDirected(n, edges, start);
}



template<typename T>
std::vector<T> range(const std::vector<T> &a, LL from, LL to){
    std::vector<T> b;
    for (LL i = from; i < to; i++){
        b.push_back(a[i]);
    }
    return b;
}

template<typename T>
bool forall(const std::vector<T> &a, std::function<bool(T)> &test){
    bool res = true;
    for (auto v : a){
        res = res & test(v);
    }
    return res;
}
LL gcd(LL a, LL b){
    if (b == 0) return a;
    return gcd(b,a%b);
}
LL moduloPower(LL a, LL b, LL modulo){
    std::vector<LL> powers(65);
    powers[0] = a;
    for (int i = 0; i < 64; i++){
        powers[i+1] = (powers[i]*powers[i])%modulo;
    }
    LL res = 1;
    for (int i = 0; i < 64; i++){
        if ((b>>i)&1){
            res *= powers[i];
            res %= modulo;
        }
    }
    return res;
}
// a*x + b*y = 1; return {x,y};
std::tuple<LL,LL> inverse(LL a, LL b){
    if (b == 0) return {1,0};
    auto [n,m] = inverse(b,a%b);
    return {m,n-(a/b)*m};
}
LL solution(LL n, LL a, LL b){
    if (n == 1){
        return 1+b-a;
    }
    return solution(n-1,a,b);
}
LL npr(LL n, LL a,LL modulo){
    LL res = 1;
    for (int i = a; i > a-n; i--){
        res *= i;
        res %= modulo;
    }
    return res;
}
LL ncr(LL n, LL r,LL modulo){
    LL res = 1;
    std::vector<LL> arr(r);
    for (int i = 1; i <= r; i++) arr[i-1] = i;
    for (int i = n; i > n-r; i--){
        LL l = i;
        for (int j = 0; j < r; j++){
            LL g = gcd(l,arr[j]);
            arr[j] /= g;
            l /= g;
        }
        res *= i;
        res %= modulo;
    }
    return res;
}



// n elements from a sets
LL nColorsOfa(LL n, LL a,LL modulo){
    return ncr(n+a-1,a-1,modulo);
    //if (n == 1) return 1;
    //if (n == 2) return a+1;
    ////ncr(((n+a)-1),a-1)
    //LL res = 0; 
    //for (int i = 0; i <= a; i++){
    //    res += nColorsOfa(n-1,i,modulo);
    //    res %= modulo;
    //}
    //return res;
}
int main() {
    //LL modulo = 998244353;
    //auto [n, a, b] = readLL3();
    //LL res = 0;
    //for (int i = a; i <= b; i++){
    //    res += nColorsOfa(i,n,modulo);
    //    res %= modulo;
    //}
    //println(res);
    auto [n,x,y] = readLL3();
    if (x>y) std::swap(x,y);
    auto arr = readVecLL(n);
    LL divisor = arr[0];
    for (auto i : arr){
        divisor = gcd(divisor,i);
    }
    if ((x%divisor)==0 && (y%divisor)==0){
        y -= x;
        std::vector<LL> arr2;
        for (int i = 0; i < n; i++){
            for (int j = i; j < n; j++){
                arr2.push_back(arr[i]+arr[j]);
            }
        }
        //println(arr2);
        std::vector<LL> arr3;
        bool allAreEven = true;
        for (LL n : arr2){
            if ((1 == n%2)){
                allAreEven = false;
            }
        }
        if (!allAreEven){
            println("Yes");
            exit(0);
        }
        //println(arr);
        //println(allAreEven);
        if (allAreEven){
            for (LL &n : arr){
                n *= 2;
            }
        }
        //println(arr);
        //println(y);
        divisor = arr[0];
        for (auto i : arr){
            divisor = gcd(divisor,i);
        }
        if ((y%divisor)==0){
            println("Yes");
        }else {
            println("No");
        }

    }else {
        println("No");
    }
    //auto [n,q] = readLL2();
    //auto arr = readVecTup2(q);
    //for (auto [a,b] : arr){
    //    println(n/gcd(n,a));
    //}
    //if (gcd(a,m) != 1) {
    //    println(-1);
    //    exit(0);
    //}
    //// a*x = 1 mod (M)
    //auto [res,b] = inverse(a,m);
    //res %= m;
    //res += m;
    //res %= m;
    //println(res);
    //println(((a*res)%m));
    //if (gcd(a,m) == 1) for (int i = m-1; i > 0; i--) {
    //    if (moduloPower(a,i,m) == 1){
    //        println(moduloPower(a,i-1,m));
    //        break;
    //    }
    //}

    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
1 5 10
8 

correct output
No

user output
No

Test 2

Verdict: ACCEPTED

input
1 5 2
112 

correct output
No

user output
No

Test 3

Verdict: ACCEPTED

input
1 31 31
31 

correct output
Yes

user output
Yes

Test 4

Verdict: ACCEPTED

input
1 10 10
6 

correct output
No

user output
No

Test 5

Verdict: ACCEPTED

input
1 22 22
22 

correct output
Yes

user output
Yes

Test 6

Verdict: ACCEPTED

input
2 5 10
8 10 

correct output
No

user output
No

Test 7

Verdict: ACCEPTED

input
2 5 2
96 96 

correct output
No

user output
No

Test 8

Verdict: ACCEPTED

input
2 6 1
8 9 

correct output
Yes

user output
Yes

Test 9

Verdict: ACCEPTED

input
2 87 87
174 174 

correct output
No

user output
No

Test 10

Verdict: ACCEPTED

input
2 3 1
9 9 

correct output
No

user output
No

Test 11

Verdict: ACCEPTED

input
3 5 10
8 10 1 

correct output
Yes

user output
Yes

Test 12

Verdict: ACCEPTED

input
3 5 2
45 45 45 

correct output
No

user output
No

Test 13

Verdict: ACCEPTED

input
3 6 1
8 9 3 

correct output
Yes

user output
Yes

Test 14

Verdict: ACCEPTED

input
3 73 73
146 146 146 

correct output
No

user output
No

Test 15

Verdict: ACCEPTED

input
3 3 1
9 9 3 

correct output
No

user output
No

Test 16

Verdict: ACCEPTED

input
2 2 1
1 7 

correct output
No

user output
No

Test 17

Verdict: ACCEPTED

input
2 2 5
8 9 

correct output
Yes

user output
Yes

Test 18

Verdict: ACCEPTED

input
2 8 7
182 182 

correct output
No

user output
No

Test 19

Verdict: ACCEPTED

input
2 6 10
38 38 

correct output
No

user output
No

Test 20

Verdict: ACCEPTED

input
2 9 9
2 6 

correct output
No

user output
No

Test 21

Verdict: ACCEPTED

input
3 2 1
1 7 5 

correct output
No

user output
No

Test 22

Verdict: ACCEPTED

input
3 2 5
8 9 3 

correct output
Yes

user output
Yes

Test 23

Verdict: ACCEPTED

input
3 98 98
98 98 98 

correct output
Yes

user output
Yes

Test 24

Verdict: ACCEPTED

input
3 6 10
8 7 9 

correct output
Yes

user output
Yes

Test 25

Verdict: ACCEPTED

input
3 9 9
2 6 1 

correct output
Yes

user output
Yes

Test 26

Verdict: ACCEPTED

input
4 5 10
8 10 1 2 

correct output
Yes

user output
Yes

Test 27

Verdict: ACCEPTED

input
4 5 2
1 10 6 10 

correct output
Yes

user output
Yes

Test 28

Verdict: ACCEPTED

input
4 6 1
116 116 116 116 

correct output
No

user output
No

Test 29

Verdict: ACCEPTED

input
4 62 62
124 124 124 124 

correct output
No

user output
No

Test 30

Verdict: ACCEPTED

input
4 3 1
99 99 99 99 

correct output
No

user output
No

Test 31

Verdict: ACCEPTED

input
5 5 10
16 16 16 16 16 

correct output
No

user output
No

Test 32

Verdict: ACCEPTED

input
5 5 2
1 10 6 10 5 

correct output
Yes

user output
Yes

Test 33

Verdict: ACCEPTED

input
5 91 91
91 91 91 91 91 

correct output
Yes

user output
Yes

Test 34

Verdict: ACCEPTED

input
5 10 10
142 142 142 142 142 

correct output
No

user output
No

Test 35

Verdict: ACCEPTED

input
5 50 50
50 50 50 50 50 

correct output
Yes

user output
Yes

Test 36

Verdict: ACCEPTED

input
10 447773956 773442532
122754 137572548 324627094 157...

correct output
Yes

user output
Yes

Test 37

Verdict: ACCEPTED

input
10 468145963 198730372
27838070 590195580 467423853 5...

correct output
No

user output
No

Test 38

Verdict: ACCEPTED

input
10 591414747 75940263
760367935 901888417 312356591 ...

correct output
Yes

user output
Yes

Test 39

Verdict: ACCEPTED

input
10 967034924 587586158
185430168 918715986 767527812 ...

correct output
No

user output
No

Test 40

Verdict: ACCEPTED

input
10 238363353 59249204
934941692 892631472 221963002 ...

correct output
Yes

user output
Yes

Test 41

Verdict: ACCEPTED

input
100 447773962 773442532
122816 137572579 324627123 157...

correct output
Yes

user output
Yes

Test 42

Verdict: ACCEPTED

input
100 468145963 198730372
27838076 590195590 467423861 5...

correct output
Yes

user output
Yes

Test 43

Verdict: ACCEPTED

input
100 591414747 75940263
760367920 901888400 312356580 ...

correct output
No

user output
No

Test 44

Verdict: ACCEPTED

input
100 967034924 587586158
185430194 918715995 767527830 ...

correct output
Yes

user output
Yes

Test 45

Verdict: ACCEPTED

input
100 238363353 59249204
934941692 892631472 221963002 ...

correct output
Yes

user output
Yes

Test 46

Verdict: ACCEPTED

input
1000 193563111 73343920
20911381 713738007 497377109 2...

correct output
Yes

user output
Yes

Test 47

Verdict: ACCEPTED

input
1000 165531091 479126951
794622300 937792320 282732340 ...

correct output
No

user output
No

Test 48

Verdict: ACCEPTED

input
1000 835051605 652127789
255057939 922810245 885062330 ...

correct output
Yes

user output
Yes

Test 49

Verdict: ACCEPTED

input
1000 551842440 989875540
830179640 707687000 934614600 ...

correct output
No

user output
No

Test 50

Verdict: ACCEPTED

input
1000 911411025 873575332
192088036 634962580 58372034 1...

correct output
No

user output
No

Test 51

Verdict: ACCEPTED

input
1000 657312726 129662684
181537270 324043958 468214806 ...

correct output
Yes

user output
Yes

Test 52

Verdict: ACCEPTED

input
1000 402714522 759753451
687521851 337069943 912780542 ...

correct output
Yes

user output
Yes

Test 53

Verdict: ACCEPTED

input
1000 914812458 132277432
79353385 137043347 960925660 9...

correct output
Yes

user output
Yes

Test 54

Verdict: ACCEPTED

input
1000 162813587 135741125
932808138 850211477 994160127 ...

correct output
Yes

user output
Yes

Test 55

Verdict: ACCEPTED

input
1000 210552500 313067625
754598250 398848375 444198100 ...

correct output
Yes

user output
Yes

Test 56

Verdict: ACCEPTED

input
1000 102595150 461729870
993215160 274295630 368909100 ...

correct output
Yes

user output
Yes

Test 57

Verdict: ACCEPTED

input
1000 84976386 253677050
233563210 613601269 384997082 ...

correct output
Yes

user output
Yes

Test 58

Verdict: ACCEPTED

input
1000 772114122 881808164
532413050 693522980 397009010 ...

correct output
No

user output
No

Test 59

Verdict: ACCEPTED

input
1000 162347439 569957770
131868530 341372779 824691456 ...

correct output
Yes

user output
Yes

Test 60

Verdict: ACCEPTED

input
1000 431412671 345615445
712283313 272616673 2158448 30...

correct output
Yes

user output
Yes

Test 61

Verdict: ACCEPTED

input
1000 900749514 942171039
514249176 442729056 294462840 ...

correct output
No

user output
No

Test 62

Verdict: ACCEPTED

input
1000 64410431 121071591
33343496 264117210 727055618 6...

correct output
Yes

user output
Yes

Test 63

Verdict: ACCEPTED

input
1000 265116311 516856979
858462072 387315344 377287820 ...

correct output
No

user output
No

Test 64

Verdict: ACCEPTED

input
1000 481775878 746812254
740990455 5066671 602160022 41...

correct output
Yes

user output
Yes

Test 65

Verdict: ACCEPTED

input
1000 274084144 960687179
696459395 627492163 271745075 ...

correct output
Yes

user output
Yes

Test 66

Verdict:

input
10000 52317939 858211636
310429135 729974978 774131725 ...

correct output
Yes

user output
(empty)

Test 67

Verdict:

input
10000 223832798 753727010
517201100 784375537 451549274 ...

correct output
Yes

user output
(empty)

Test 68

Verdict: ACCEPTED

input
10000 555444372 718437552
198629856 821906136 839321976 ...

correct output
No

user output
No

Test 69

Verdict:

input
10000 316145889 751095345
56752214 340900389 236295457 3...

correct output
Yes

user output
(empty)

Test 70

Verdict:

input
10000 934288674 747395152
625215095 465197604 299401040 ...

correct output
Yes

user output
(empty)

Test 71

Verdict:

input
100000 307147957 31129494
346102496 827117209 656524198 ...

correct output
Yes

user output
(empty)

Test 72

Verdict:

input
100000 922225334 64055691
400195554 452086094 596064992 ...

correct output
Yes

user output
(empty)

Test 73

Verdict:

input
100000 266835718 740541026
483157431 718635153 441244325 ...

correct output
Yes

user output
(empty)

Test 74

Verdict:

input
100000 41405289 210199839
837626491 454596059 99539902 4...

correct output
Yes

user output
(empty)

Test 75

Verdict:

input
100000 491832755 482963780
331087868 726411502 248557321 ...

correct output
Yes

user output
(empty)