import java.io.*;
import java.util.*;

public class Main {

    public static void main(String[] args) {
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);
        Task solve = new Task();
        solve.solve(in, out);
        out.close();
    }

    static class Task {
        public void solve(InputReader in, PrintWriter out) {
//            int T = in.nextInt();
//            while (T-- > 0) {
                int a = in.nextInt();
                int b = in.nextInt();
                int c = in.nextInt();
                boolean flag = true;
                if (a == b && b == c) flag = false;
                if (a != b && b != c && a != c) flag = false;
                out.println(flag ? "Yes" : "No");
//            }
        }

        public int lowerBound(long[] a, long x) {
            int l = 0, r = a.length - 1, mid = (l + r) / 2;
            while (l <= r) {
                if (a[mid] >= x) r = mid;
                else l = mid + 1;
                if (l == r) {
                    if (a[l] >= x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            }
            return l;
        }

        public int upperBound(long[] a, long x) {
            int l = 0, r = a.length - 1, mid = (l + r) / 2;
            while (l <= r) {
                if (a[mid] <= x) l = mid + 1;
                else r = mid;
                if (l == r) {
                    if (a[l] > x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            }
            return l;
        }

        private void perm(int[] a, int cur, List<Integer> tmp, List<List<Integer>> list) {
            if (cur == a.length) {
                List<Integer> res = new ArrayList<>();
                res.addAll(tmp);
                list.add(res);
                return;
            }
            for (int i = cur; i < a.length; ++i) {
                swap(a, i, cur);
                tmp.add(a[cur]);
                perm(a, cur + 1, tmp, list);
                tmp.remove(tmp.size() - 1);
                swap(a, i, cur);
            }
        }

        public void swap(int[] a, int i, int j) {
            int t = a[i];
            a[i] = a[j];
            a[j] = t;
        }
    }

    public static class P {
        int x, y;
        P() {}
        P(int u, int v) { x = u; y = v; }
    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
    }
} import java.io.*; io.* java import java.util.*; util.* java public class Main {

    public static void main(String[] args) {
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);
        Task solve = new Task();
        solve.solve(in, out);
        out.close();
    }

    static class Task {
        public void solve(InputReader in, PrintWriter out) {
//            int T = in.nextInt();
//            while (T-- > 0) {
                int a = in.nextInt();
                int b = in.nextInt();
                int c = in.nextInt();
                boolean flag = true;
                if (a == b && b == c) flag = false;
                if (a != b && b != c && a != c) flag = false;
                out.println(flag ? "Yes" : "No");
//            }
        }

        public int lowerBound(long[] a, long x) {
            int l = 0, r = a.length - 1, mid = (l + r) / 2;
            while (l <= r) {
                if (a[mid] >= x) r = mid;
                else l = mid + 1;
                if (l == r) {
                    if (a[l] >= x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            }
            return l;
        }

        public int upperBound(long[] a, long x) {
            int l = 0, r = a.length - 1, mid = (l + r) / 2;
            while (l <= r) {
                if (a[mid] <= x) l = mid + 1;
                else r = mid;
                if (l == r) {
                    if (a[l] > x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            }
            return l;
        }

        private void perm(int[] a, int cur, List<Integer> tmp, List<List<Integer>> list) {
            if (cur == a.length) {
                List<Integer> res = new ArrayList<>();
                res.addAll(tmp);
                list.add(res);
                return;
            }
            for (int i = cur; i < a.length; ++i) {
                swap(a, i, cur);
                tmp.add(a[cur]);
                perm(a, cur + 1, tmp, list);
                tmp.remove(tmp.size() - 1);
                swap(a, i, cur);
            }
        }

        public void swap(int[] a, int i, int j) {
            int t = a[i];
            a[i] = a[j];
            a[j] = t;
        }
    }

    public static class P {
        int x, y;
        P() {}
        P(int u, int v) { x = u; y = v; }
    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
    }
} Main public static void main(String[] args) {
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);
        Task solve = new Task();
        solve.solve(in, out);
        out.close();
    } main {
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);
        Task solve = new Task();
        solve.solve(in, out);
        out.close();
    } InputReader in = new InputReader(System.in); in new InputReader(System.in) PrintWriter out = new PrintWriter(System.out); out new PrintWriter(System.out) Task solve = new Task(); solve new Task() solve.solve(in, out) solve.solve solve in out out.close() out.close out String[] args args static class Task {
        public void solve(InputReader in, PrintWriter out) {
//            int T = in.nextInt();
//            while (T-- > 0) {
                int a = in.nextInt();
                int b = in.nextInt();
                int c = in.nextInt();
                boolean flag = true;
                if (a == b && b == c) flag = false;
                if (a != b && b != c && a != c) flag = false;
                out.println(flag ? "Yes" : "No");
//            }
        }

        public int lowerBound(long[] a, long x) {
            int l = 0, r = a.length - 1, mid = (l + r) / 2;
            while (l <= r) {
                if (a[mid] >= x) r = mid;
                else l = mid + 1;
                if (l == r) {
                    if (a[l] >= x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            }
            return l;
        }

        public int upperBound(long[] a, long x) {
            int l = 0, r = a.length - 1, mid = (l + r) / 2;
            while (l <= r) {
                if (a[mid] <= x) l = mid + 1;
                else r = mid;
                if (l == r) {
                    if (a[l] > x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            }
            return l;
        }

        private void perm(int[] a, int cur, List<Integer> tmp, List<List<Integer>> list) {
            if (cur == a.length) {
                List<Integer> res = new ArrayList<>();
                res.addAll(tmp);
                list.add(res);
                return;
            }
            for (int i = cur; i < a.length; ++i) {
                swap(a, i, cur);
                tmp.add(a[cur]);
                perm(a, cur + 1, tmp, list);
                tmp.remove(tmp.size() - 1);
                swap(a, i, cur);
            }
        }

        public void swap(int[] a, int i, int j) {
            int t = a[i];
            a[i] = a[j];
            a[j] = t;
        }
    } Task public void solve(InputReader in, PrintWriter out) {
//            int T = in.nextInt();
//            while (T-- > 0) {
                int a = in.nextInt();
                int b = in.nextInt();
                int c = in.nextInt();
                boolean flag = true;
                if (a == b && b == c) flag = false;
                if (a != b && b != c && a != c) flag = false;
                out.println(flag ? "Yes" : "No");
//            }
        } solve {
//            int T = in.nextInt();
//            while (T-- > 0) {
                int a = in.nextInt();
                int b = in.nextInt();
                int c = in.nextInt();
                boolean flag = true;
                if (a == b && b == c) flag = false;
                if (a != b && b != c && a != c) flag = false;
                out.println(flag ? "Yes" : "No");
//            }
        } int a = in.nextInt(); a in.nextInt() in.nextInt in int b = in.nextInt(); b in.nextInt() in.nextInt in int c = in.nextInt(); c in.nextInt() in.nextInt in boolean flag = true; flag true if (a == b && b == c) flag = false; a == b && b == c a == b a b b == c b c flag = false flag false if (a != b && b != c && a != c) flag = false; a != b && b != c && a != c a != b && b != c && a != c a != b a b b != c b c a != c a c flag = false flag false out.println(flag ? "Yes" : "No") out.println out flag ? "Yes" : "No" flag "Yes" "No" InputReader in in PrintWriter out out public int lowerBound(long[] a, long x) {
            int l = 0, r = a.length - 1, mid = (l + r) / 2;
            while (l <= r) {
                if (a[mid] >= x) r = mid;
                else l = mid + 1;
                if (l == r) {
                    if (a[l] >= x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            }
            return l;
        } lowerBound {
            int l = 0, r = a.length - 1, mid = (l + r) / 2;
            while (l <= r) {
                if (a[mid] >= x) r = mid;
                else l = mid + 1;
                if (l == r) {
                    if (a[l] >= x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            }
            return l;
        } int l = 0 l 0 r = a.length - 1 r a.length - 1 a.length a a.length 1 mid = (l + r) / 2; mid (l + r) / 2 (l + r) l r 2 while (l <= r) {
                if (a[mid] >= x) r = mid;
                else l = mid + 1;
                if (l == r) {
                    if (a[l] >= x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            } l <= r l r {
                if (a[mid] >= x) r = mid;
                else l = mid + 1;
                if (l == r) {
                    if (a[l] >= x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            } if (a[mid] >= x) r = mid;
                else l = mid + 1; a[mid] >= x a[mid] a mid x r = mid r mid l = mid + 1 l mid + 1 mid 1 if (l == r) {
                    if (a[l] >= x) return l;
                    else return l + 1;
                } l == r l r {
                    if (a[l] >= x) return l;
                    else return l + 1;
                } if (a[l] >= x) return l;
                    else return l + 1; a[l] >= x a[l] a l x return l; l return l + 1; l + 1 l 1 mid = (l + r) / 2 mid (l + r) / 2 (l + r) l r 2 return l; l long[] a a long x x public int upperBound(long[] a, long x) {
            int l = 0, r = a.length - 1, mid = (l + r) / 2;
            while (l <= r) {
                if (a[mid] <= x) l = mid + 1;
                else r = mid;
                if (l == r) {
                    if (a[l] > x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            }
            return l;
        } upperBound {
            int l = 0, r = a.length - 1, mid = (l + r) / 2;
            while (l <= r) {
                if (a[mid] <= x) l = mid + 1;
                else r = mid;
                if (l == r) {
                    if (a[l] > x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            }
            return l;
        } int l = 0 l 0 r = a.length - 1 r a.length - 1 a.length a a.length 1 mid = (l + r) / 2; mid (l + r) / 2 (l + r) l r 2 while (l <= r) {
                if (a[mid] <= x) l = mid + 1;
                else r = mid;
                if (l == r) {
                    if (a[l] > x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            } l <= r l r {
                if (a[mid] <= x) l = mid + 1;
                else r = mid;
                if (l == r) {
                    if (a[l] > x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            } if (a[mid] <= x) l = mid + 1;
                else r = mid; a[mid] <= x a[mid] a mid x l = mid + 1 l mid + 1 mid 1 r = mid r mid if (l == r) {
                    if (a[l] > x) return l;
                    else return l + 1;
                } l == r l r {
                    if (a[l] > x) return l;
                    else return l + 1;
                } if (a[l] > x) return l;
                    else return l + 1; a[l] > x a[l] a l x return l; l return l + 1; l + 1 l 1 mid = (l + r) / 2 mid (l + r) / 2 (l + r) l r 2 return l; l long[] a a long x x private void perm(int[] a, int cur, List<Integer> tmp, List<List<Integer>> list) {
            if (cur == a.length) {
                List<Integer> res = new ArrayList<>();
                res.addAll(tmp);
                list.add(res);
                return;
            }
            for (int i = cur; i < a.length; ++i) {
                swap(a, i, cur);
                tmp.add(a[cur]);
                perm(a, cur + 1, tmp, list);
                tmp.remove(tmp.size() - 1);
                swap(a, i, cur);
            }
        } perm {
            if (cur == a.length) {
                List<Integer> res = new ArrayList<>();
                res.addAll(tmp);
                list.add(res);
                return;
            }
            for (int i = cur; i < a.length; ++i) {
                swap(a, i, cur);
                tmp.add(a[cur]);
                perm(a, cur + 1, tmp, list);
                tmp.remove(tmp.size() - 1);
                swap(a, i, cur);
            }
        } if (cur == a.length) {
                List<Integer> res = new ArrayList<>();
                res.addAll(tmp);
                list.add(res);
                return;
            } cur == a.length cur a.length a a.length {
                List<Integer> res = new ArrayList<>();
                res.addAll(tmp);
                list.add(res);
                return;
            } List<Integer> res = new ArrayList<>(); res new ArrayList<>() res.addAll(tmp) res.addAll res tmp list.add(res) list.add list res return; for (int i = cur; i < a.length; ++i) {
                swap(a, i, cur);
                tmp.add(a[cur]);
                perm(a, cur + 1, tmp, list);
                tmp.remove(tmp.size() - 1);
                swap(a, i, cur);
            } int i = cur; int i = cur; i cur i < a.length i a.length a a.length ++i ++i i {
                swap(a, i, cur);
                tmp.add(a[cur]);
                perm(a, cur + 1, tmp, list);
                tmp.remove(tmp.size() - 1);
                swap(a, i, cur);
            } {
                swap(a, i, cur);
                tmp.add(a[cur]);
                perm(a, cur + 1, tmp, list);
                tmp.remove(tmp.size() - 1);
                swap(a, i, cur);
            } swap(a, i, cur) swap a i cur tmp.add(a[cur]) tmp.add tmp a[cur] a cur perm(a, cur + 1, tmp, list) perm a cur + 1 cur 1 tmp list tmp.remove(tmp.size() - 1) tmp.remove tmp tmp.size() - 1 tmp.size() tmp.size tmp 1 swap(a, i, cur) swap a i cur int[] a a int cur cur List<Integer> tmp tmp List<List<Integer>> list list public void swap(int[] a, int i, int j) {
            int t = a[i];
            a[i] = a[j];
            a[j] = t;
        } swap {
            int t = a[i];
            a[i] = a[j];
            a[j] = t;
        } int t = a[i]; t a[i] a i a[i] = a[j] a[i] a i a[j] a j a[j] = t a[j] a j t int[] a a int i i int j j public static class P {
        int x, y;
        P() {}
        P(int u, int v) { x = u; y = v; }
    } P int x x y; y P() {} P {} P(int u, int v) { x = u; y = v; } P { x = u; y = v; } x = u x u y = v y v int u u int v v static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
    } InputReader BufferedReader reader; reader StringTokenizer tokenizer; tokenizer public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        } InputReader {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        } reader = new BufferedReader(new InputStreamReader(stream), 32768) reader new BufferedReader(new InputStreamReader(stream), 32768) tokenizer = null tokenizer null InputStream stream stream public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        } next {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        } while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            } tokenizer == null || !tokenizer.hasMoreTokens() tokenizer == null tokenizer null !tokenizer.hasMoreTokens() tokenizer.hasMoreTokens() tokenizer.hasMoreTokens tokenizer {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            } try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                } catch (IOException e) {
                    throw new RuntimeException(e);
                } IOException e {
                    throw new RuntimeException(e);
                } throw new RuntimeException(e); new RuntimeException(e) {
                    tokenizer = new StringTokenizer(reader.readLine());
                } tokenizer = new StringTokenizer(reader.readLine()) tokenizer new StringTokenizer(reader.readLine()) return tokenizer.nextToken(); tokenizer.nextToken() tokenizer.nextToken tokenizer public int nextInt() {
            return Integer.parseInt(next());
        } nextInt {
            return Integer.parseInt(next());
        } return Integer.parseInt(next()); Integer.parseInt(next()) Integer.parseInt Integer next() next public class Main {

    public static void main(String[] args) {
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);
        Task solve = new Task();
        solve.solve(in, out);
        out.close();
    }

    static class Task {
        public void solve(InputReader in, PrintWriter out) {
//            int T = in.nextInt();
//            while (T-- > 0) {
                int a = in.nextInt();
                int b = in.nextInt();
                int c = in.nextInt();
                boolean flag = true;
                if (a == b && b == c) flag = false;
                if (a != b && b != c && a != c) flag = false;
                out.println(flag ? "Yes" : "No");
//            }
        }

        public int lowerBound(long[] a, long x) {
            int l = 0, r = a.length - 1, mid = (l + r) / 2;
            while (l <= r) {
                if (a[mid] >= x) r = mid;
                else l = mid + 1;
                if (l == r) {
                    if (a[l] >= x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            }
            return l;
        }

        public int upperBound(long[] a, long x) {
            int l = 0, r = a.length - 1, mid = (l + r) / 2;
            while (l <= r) {
                if (a[mid] <= x) l = mid + 1;
                else r = mid;
                if (l == r) {
                    if (a[l] > x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            }
            return l;
        }

        private void perm(int[] a, int cur, List<Integer> tmp, List<List<Integer>> list) {
            if (cur == a.length) {
                List<Integer> res = new ArrayList<>();
                res.addAll(tmp);
                list.add(res);
                return;
            }
            for (int i = cur; i < a.length; ++i) {
                swap(a, i, cur);
                tmp.add(a[cur]);
                perm(a, cur + 1, tmp, list);
                tmp.remove(tmp.size() - 1);
                swap(a, i, cur);
            }
        }

        public void swap(int[] a, int i, int j) {
            int t = a[i];
            a[i] = a[j];
            a[j] = t;
        }
    }

    public static class P {
        int x, y;
        P() {}
        P(int u, int v) { x = u; y = v; }
    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
    }
} public class Main {

    public static void main(String[] args) {
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);
        Task solve = new Task();
        solve.solve(in, out);
        out.close();
    }

    static class Task {
        public void solve(InputReader in, PrintWriter out) {
//            int T = in.nextInt();
//            while (T-- > 0) {
                int a = in.nextInt();
                int b = in.nextInt();
                int c = in.nextInt();
                boolean flag = true;
                if (a == b && b == c) flag = false;
                if (a != b && b != c && a != c) flag = false;
                out.println(flag ? "Yes" : "No");
//            }
        }

        public int lowerBound(long[] a, long x) {
            int l = 0, r = a.length - 1, mid = (l + r) / 2;
            while (l <= r) {
                if (a[mid] >= x) r = mid;
                else l = mid + 1;
                if (l == r) {
                    if (a[l] >= x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            }
            return l;
        }

        public int upperBound(long[] a, long x) {
            int l = 0, r = a.length - 1, mid = (l + r) / 2;
            while (l <= r) {
                if (a[mid] <= x) l = mid + 1;
                else r = mid;
                if (l == r) {
                    if (a[l] > x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            }
            return l;
        }

        private void perm(int[] a, int cur, List<Integer> tmp, List<List<Integer>> list) {
            if (cur == a.length) {
                List<Integer> res = new ArrayList<>();
                res.addAll(tmp);
                list.add(res);
                return;
            }
            for (int i = cur; i < a.length; ++i) {
                swap(a, i, cur);
                tmp.add(a[cur]);
                perm(a, cur + 1, tmp, list);
                tmp.remove(tmp.size() - 1);
                swap(a, i, cur);
            }
        }

        public void swap(int[] a, int i, int j) {
            int t = a[i];
            a[i] = a[j];
            a[j] = t;
        }
    }

    public static class P {
        int x, y;
        P() {}
        P(int u, int v) { x = u; y = v; }
    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
    }
} Main
import java.io.*;
import java.util.*;

public class Main {

    public static void main(String[] args) {
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);
        Task solve = new Task();
        solve.solve(in, out);
        out.close();
    }

    static class Task {
        public void solve(InputReader in, PrintWriter out) {
//            int T = in.nextInt();
//            while (T-- > 0) {
                int a = in.nextInt();
                int b = in.nextInt();
                int c = in.nextInt();
                boolean flag = true;
                if (a == b && b == c) flag = false;
                if (a != b && b != c && a != c) flag = false;
                out.println(flag ? "Yes" : "No");
//            }
        }

        public int lowerBound(long[] a, long x) {
            int l = 0, r = a.length - 1, mid = (l + r) / 2;
            while (l <= r) {
                if (a[mid] >= x) r = mid;
                else l = mid + 1;
                if (l == r) {
                    if (a[l] >= x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            }
            return l;
        }

        public int upperBound(long[] a, long x) {
            int l = 0, r = a.length - 1, mid = (l + r) / 2;
            while (l <= r) {
                if (a[mid] <= x) l = mid + 1;
                else r = mid;
                if (l == r) {
                    if (a[l] > x) return l;
                    else return l + 1;
                }
                mid = (l + r) / 2;
            }
            return l;
        }

        private void perm(int[] a, int cur, List<Integer> tmp, List<List<Integer>> list) {
            if (cur == a.length) {
                List<Integer> res = new ArrayList<>();
                res.addAll(tmp);
                list.add(res);
                return;
            }
            for (int i = cur; i < a.length; ++i) {
                swap(a, i, cur);
                tmp.add(a[cur]);
                perm(a, cur + 1, tmp, list);
                tmp.remove(tmp.size() - 1);
                swap(a, i, cur);
            }
        }

        public void swap(int[] a, int i, int j) {
            int t = a[i];
            a[i] = a[j];
            a[j] = t;
        }
    }

    public static class P {
        int x, y;
        P() {}
        P(int u, int v) { x = u; y = v; }
    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
    }
}