import java.util.Scanner;


public class Main {

    public static String Y = "Yes";
    public static String N = "No";
    public static long MOD = (long) (Math.pow(10, 9) + 7);
    public static Scanner sc = new Scanner(System.in);

    public static void main(String[] args) {

        int n = ni();
        int a = ni();
        int b = ni();

        int count = 0;

        for (int i = 1; i <= n; i++) {
            int sum = ketaSum(i);

            if (sum <= b && sum >= a) {
                count += i;
            }
        }
        out(count);

    }

    /*
     * 以下メソッド集
     */

    static int ketasuu(int n) {

        String str = "" + n;
        return str.length();
    }

    static int ketaSum(int n) {

        String str = "" + n;
        int sum = 0;
        for (int i = 0; i < str.length(); i++) {
            sum += Integer.parseInt(str.substring(i, i + 1));
        }
        return sum;
    }

    static int abcount(String str) {

        int count = 0;
        int len = str.length();
        for (int i = 0; i < len - 1; i++) {
            if ("AB".equals(str.substring(i, i + "AB".length()))) {
                count++;
            }
        }
        return count;
    }

    static int ni() {

        return sc.nextInt();
    }

    static long nl() {

        return sc.nextLong();
    }

    static double nd() {

        return sc.nextDouble();
    }

    static String n() {

        return sc.next();
    }

    static char[] nc() {

        return sc.next().toCharArray();
    }

    static int kaijo(int n) {

        if (n == 0 || n == 1) {
            return 1;
        } else {
            return n * kaijo(n - 1);
        }
    }

    static int fib(int n) {

        return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
    }

    static long lcm(long m, long n) {

        return m * n / gcd(m, n);
    }

    static int lcm(int m, int n) {

        return m * n / gcd(m, n);
    }

    static long gcd(long a, long b) {

        return (b == 0) ? a : gcd(b, a % b);
    }

    static int gcd(int a, int b) {

        return (b == 0) ? a : gcd(b, a % b);
    }

    static void out(String info) {

        System.out.println(info);
    }

    static void out(int info) {

        System.out.println(info);
    }

    static void out(double info) {

        System.out.println(info);
    }

    static void out(long info) {

        System.out.println(info);
    }

    static void out(char info) {

        System.out.println(info);
    }

    static void out(Object obj) {

        System.out.println(obj.toString());
    }

    static void outn(String info) {

        System.out.print(info);
    }

    static void outn(int info) {

        System.out.print(info);
    }

    static void outn(double info) {

        System.out.print(info);
    }

    static void outn(long info) {

        System.out.print(info);
    }

    static void outn(char info) {

        System.out.print(info);
    }

    static double max(double d, double e) {

        return Math.max(d, e);
    }

    static long max(long a, long b) {

        return Math.max(a, b);
    }

    static double min(double d, double e) {

        return Math.min(d, e);
    }

    static long min(long a, long b) {

        return Math.min(a, b);
    }
}


class XY {

    int h;
    int c;

    XY(int h, int c) {
        this.h = h;
        this.c = c;
    }
} import java.util.Scanner; Scanner java.util public class Main {

    public static String Y = "Yes";
    public static String N = "No";
    public static long MOD = (long) (Math.pow(10, 9) + 7);
    public static Scanner sc = new Scanner(System.in);

    public static void main(String[] args) {

        int n = ni();
        int a = ni();
        int b = ni();

        int count = 0;

        for (int i = 1; i <= n; i++) {
            int sum = ketaSum(i);

            if (sum <= b && sum >= a) {
                count += i;
            }
        }
        out(count);

    }

    /*
     * 以下メソッド集
     */

    static int ketasuu(int n) {

        String str = "" + n;
        return str.length();
    }

    static int ketaSum(int n) {

        String str = "" + n;
        int sum = 0;
        for (int i = 0; i < str.length(); i++) {
            sum += Integer.parseInt(str.substring(i, i + 1));
        }
        return sum;
    }

    static int abcount(String str) {

        int count = 0;
        int len = str.length();
        for (int i = 0; i < len - 1; i++) {
            if ("AB".equals(str.substring(i, i + "AB".length()))) {
                count++;
            }
        }
        return count;
    }

    static int ni() {

        return sc.nextInt();
    }

    static long nl() {

        return sc.nextLong();
    }

    static double nd() {

        return sc.nextDouble();
    }

    static String n() {

        return sc.next();
    }

    static char[] nc() {

        return sc.next().toCharArray();
    }

    static int kaijo(int n) {

        if (n == 0 || n == 1) {
            return 1;
        } else {
            return n * kaijo(n - 1);
        }
    }

    static int fib(int n) {

        return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
    }

    static long lcm(long m, long n) {

        return m * n / gcd(m, n);
    }

    static int lcm(int m, int n) {

        return m * n / gcd(m, n);
    }

    static long gcd(long a, long b) {

        return (b == 0) ? a : gcd(b, a % b);
    }

    static int gcd(int a, int b) {

        return (b == 0) ? a : gcd(b, a % b);
    }

    static void out(String info) {

        System.out.println(info);
    }

    static void out(int info) {

        System.out.println(info);
    }

    static void out(double info) {

        System.out.println(info);
    }

    static void out(long info) {

        System.out.println(info);
    }

    static void out(char info) {

        System.out.println(info);
    }

    static void out(Object obj) {

        System.out.println(obj.toString());
    }

    static void outn(String info) {

        System.out.print(info);
    }

    static void outn(int info) {

        System.out.print(info);
    }

    static void outn(double info) {

        System.out.print(info);
    }

    static void outn(long info) {

        System.out.print(info);
    }

    static void outn(char info) {

        System.out.print(info);
    }

    static double max(double d, double e) {

        return Math.max(d, e);
    }

    static long max(long a, long b) {

        return Math.max(a, b);
    }

    static double min(double d, double e) {

        return Math.min(d, e);
    }

    static long min(long a, long b) {

        return Math.min(a, b);
    }
} Main public static String Y = "Yes"; Y "Yes" public static String N = "No"; N "No" public static long MOD = (long) (Math.pow(10, 9) + 7); MOD (long) (Math.pow(10, 9) + 7) Math.pow(10, 9) Math.pow Math 10 9 7 public static Scanner sc = new Scanner(System.in); sc new Scanner(System.in) public static void main(String[] args) {

        int n = ni();
        int a = ni();
        int b = ni();

        int count = 0;

        for (int i = 1; i <= n; i++) {
            int sum = ketaSum(i);

            if (sum <= b && sum >= a) {
                count += i;
            }
        }
        out(count);

    } main {

        int n = ni();
        int a = ni();
        int b = ni();

        int count = 0;

        for (int i = 1; i <= n; i++) {
            int sum = ketaSum(i);

            if (sum <= b && sum >= a) {
                count += i;
            }
        }
        out(count);

    } int n = ni(); n ni() ni int a = ni(); a ni() ni int b = ni(); b ni() ni int count = 0; count 0 for (int i = 1; i <= n; i++) {
            int sum = ketaSum(i);

            if (sum <= b && sum >= a) {
                count += i;
            }
        } int i = 1; int i = 1; i 1 i <= n i n i++ i++ i {
            int sum = ketaSum(i);

            if (sum <= b && sum >= a) {
                count += i;
            }
        } {
            int sum = ketaSum(i);

            if (sum <= b && sum >= a) {
                count += i;
            }
        } int sum = ketaSum(i); sum ketaSum(i) ketaSum i if (sum <= b && sum >= a) {
                count += i;
            } sum <= b && sum >= a sum <= b sum b sum >= a sum a {
                count += i;
            } count += i count i out(count) out count String[] args args static int ketasuu(int n) {

        String str = "" + n;
        return str.length();
    } ketasuu {

        String str = "" + n;
        return str.length();
    } String str = "" + n; str "" + n "" n return str.length(); str.length() str.length str int n n static int ketaSum(int n) {

        String str = "" + n;
        int sum = 0;
        for (int i = 0; i < str.length(); i++) {
            sum += Integer.parseInt(str.substring(i, i + 1));
        }
        return sum;
    } ketaSum {

        String str = "" + n;
        int sum = 0;
        for (int i = 0; i < str.length(); i++) {
            sum += Integer.parseInt(str.substring(i, i + 1));
        }
        return sum;
    } String str = "" + n; str "" + n "" n int sum = 0; sum 0 for (int i = 0; i < str.length(); i++) {
            sum += Integer.parseInt(str.substring(i, i + 1));
        } int i = 0; int i = 0; i 0 i < str.length() i str.length() str.length str i++ i++ i {
            sum += Integer.parseInt(str.substring(i, i + 1));
        } {
            sum += Integer.parseInt(str.substring(i, i + 1));
        } sum += Integer.parseInt(str.substring(i, i + 1)) sum Integer.parseInt(str.substring(i, i + 1)) Integer.parseInt Integer str.substring(i, i + 1) str.substring str i i + 1 i 1 return sum; sum int n n static int abcount(String str) {

        int count = 0;
        int len = str.length();
        for (int i = 0; i < len - 1; i++) {
            if ("AB".equals(str.substring(i, i + "AB".length()))) {
                count++;
            }
        }
        return count;
    } abcount {

        int count = 0;
        int len = str.length();
        for (int i = 0; i < len - 1; i++) {
            if ("AB".equals(str.substring(i, i + "AB".length()))) {
                count++;
            }
        }
        return count;
    } int count = 0; count 0 int len = str.length(); len str.length() str.length str for (int i = 0; i < len - 1; i++) {
            if ("AB".equals(str.substring(i, i + "AB".length()))) {
                count++;
            }
        } int i = 0; int i = 0; i 0 i < len - 1 i len - 1 len 1 i++ i++ i {
            if ("AB".equals(str.substring(i, i + "AB".length()))) {
                count++;
            }
        } {
            if ("AB".equals(str.substring(i, i + "AB".length()))) {
                count++;
            }
        } if ("AB".equals(str.substring(i, i + "AB".length()))) {
                count++;
            } "AB".equals(str.substring(i, i + "AB".length())) "AB".equals "AB" str.substring(i, i + "AB".length()) str.substring str i i + "AB".length() i "AB".length() "AB".length "AB" {
                count++;
            } count++ count return count; count String str str static int ni() {

        return sc.nextInt();
    } ni {

        return sc.nextInt();
    } return sc.nextInt(); sc.nextInt() sc.nextInt sc static long nl() {

        return sc.nextLong();
    } nl {

        return sc.nextLong();
    } return sc.nextLong(); sc.nextLong() sc.nextLong sc static double nd() {

        return sc.nextDouble();
    } nd {

        return sc.nextDouble();
    } return sc.nextDouble(); sc.nextDouble() sc.nextDouble sc static String n() {

        return sc.next();
    } n {

        return sc.next();
    } return sc.next(); sc.next() sc.next sc static char[] nc() {

        return sc.next().toCharArray();
    } nc {

        return sc.next().toCharArray();
    } return sc.next().toCharArray(); sc.next().toCharArray() sc.next().toCharArray sc.next() sc.next sc static int kaijo(int n) {

        if (n == 0 || n == 1) {
            return 1;
        } else {
            return n * kaijo(n - 1);
        }
    } kaijo {

        if (n == 0 || n == 1) {
            return 1;
        } else {
            return n * kaijo(n - 1);
        }
    } if (n == 0 || n == 1) {
            return 1;
        } else {
            return n * kaijo(n - 1);
        } n == 0 || n == 1 n == 0 n 0 n == 1 n 1 {
            return 1;
        } return 1; 1 {
            return n * kaijo(n - 1);
        } return n * kaijo(n - 1); n * kaijo(n - 1) n kaijo(n - 1) kaijo n - 1 n 1 int n n static int fib(int n) {

        return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
    } fib {

        return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
    } return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1); (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1) (n == 1 || n == 0) n == 1 n 1 n == 0 n 0 n fib(n - 2) + fib(n - 1) fib(n - 2) fib n - 2 n 2 fib(n - 1) fib n - 1 n 1 int n n static long lcm(long m, long n) {

        return m * n / gcd(m, n);
    } lcm {

        return m * n / gcd(m, n);
    } return m * n / gcd(m, n); m * n / gcd(m, n) m * n m n gcd(m, n) gcd m n long m m long n n static int lcm(int m, int n) {

        return m * n / gcd(m, n);
    } lcm {

        return m * n / gcd(m, n);
    } return m * n / gcd(m, n); m * n / gcd(m, n) m * n m n gcd(m, n) gcd m n int m m int n n static long gcd(long a, long b) {

        return (b == 0) ? a : gcd(b, a % b);
    } gcd {

        return (b == 0) ? a : gcd(b, a % b);
    } return (b == 0) ? a : gcd(b, a % b); (b == 0) ? a : gcd(b, a % b) (b == 0) b 0 a gcd(b, a % b) gcd b a % b a b long a a long b b static int gcd(int a, int b) {

        return (b == 0) ? a : gcd(b, a % b);
    } gcd {

        return (b == 0) ? a : gcd(b, a % b);
    } return (b == 0) ? a : gcd(b, a % b); (b == 0) ? a : gcd(b, a % b) (b == 0) b 0 a gcd(b, a % b) gcd b a % b a b int a a int b b static void out(String info) {

        System.out.println(info);
    } out {

        System.out.println(info);
    } System.out.println(info) System.out.println System.out System System.out info String info info static void out(int info) {

        System.out.println(info);
    } out {

        System.out.println(info);
    } System.out.println(info) System.out.println System.out System System.out info int info info static void out(double info) {

        System.out.println(info);
    } out {

        System.out.println(info);
    } System.out.println(info) System.out.println System.out System System.out info double info info static void out(long info) {

        System.out.println(info);
    } out {

        System.out.println(info);
    } System.out.println(info) System.out.println System.out System System.out info long info info static void out(char info) {

        System.out.println(info);
    } out {

        System.out.println(info);
    } System.out.println(info) System.out.println System.out System System.out info char info info static void out(Object obj) {

        System.out.println(obj.toString());
    } out {

        System.out.println(obj.toString());
    } System.out.println(obj.toString()) System.out.println System.out System System.out obj.toString() obj.toString obj Object obj obj static void outn(String info) {

        System.out.print(info);
    } outn {

        System.out.print(info);
    } System.out.print(info) System.out.print System.out System System.out info String info info static void outn(int info) {

        System.out.print(info);
    } outn {

        System.out.print(info);
    } System.out.print(info) System.out.print System.out System System.out info int info info static void outn(double info) {

        System.out.print(info);
    } outn {

        System.out.print(info);
    } System.out.print(info) System.out.print System.out System System.out info double info info static void outn(long info) {

        System.out.print(info);
    } outn {

        System.out.print(info);
    } System.out.print(info) System.out.print System.out System System.out info long info info static void outn(char info) {

        System.out.print(info);
    } outn {

        System.out.print(info);
    } System.out.print(info) System.out.print System.out System System.out info char info info static double max(double d, double e) {

        return Math.max(d, e);
    } max {

        return Math.max(d, e);
    } return Math.max(d, e); Math.max(d, e) Math.max Math d e double d d double e e static long max(long a, long b) {

        return Math.max(a, b);
    } max {

        return Math.max(a, b);
    } return Math.max(a, b); Math.max(a, b) Math.max Math a b long a a long b b static double min(double d, double e) {

        return Math.min(d, e);
    } min {

        return Math.min(d, e);
    } return Math.min(d, e); Math.min(d, e) Math.min Math d e double d d double e e static long min(long a, long b) {

        return Math.min(a, b);
    } min {

        return Math.min(a, b);
    } return Math.min(a, b); Math.min(a, b) Math.min Math a b long a a long b b class XY {

    int h;
    int c;

    XY(int h, int c) {
        this.h = h;
        this.c = c;
    }
} XY int h; h int c; c XY(int h, int c) {
        this.h = h;
        this.c = c;
    } XY {
        this.h = h;
        this.c = c;
    } this.h = h this.h this this.h h this.c = c this.c this this.c c int h h int c c public class Main {

    public static String Y = "Yes";
    public static String N = "No";
    public static long MOD = (long) (Math.pow(10, 9) + 7);
    public static Scanner sc = new Scanner(System.in);

    public static void main(String[] args) {

        int n = ni();
        int a = ni();
        int b = ni();

        int count = 0;

        for (int i = 1; i <= n; i++) {
            int sum = ketaSum(i);

            if (sum <= b && sum >= a) {
                count += i;
            }
        }
        out(count);

    }

    /*
     * 以下メソッド集
     */

    static int ketasuu(int n) {

        String str = "" + n;
        return str.length();
    }

    static int ketaSum(int n) {

        String str = "" + n;
        int sum = 0;
        for (int i = 0; i < str.length(); i++) {
            sum += Integer.parseInt(str.substring(i, i + 1));
        }
        return sum;
    }

    static int abcount(String str) {

        int count = 0;
        int len = str.length();
        for (int i = 0; i < len - 1; i++) {
            if ("AB".equals(str.substring(i, i + "AB".length()))) {
                count++;
            }
        }
        return count;
    }

    static int ni() {

        return sc.nextInt();
    }

    static long nl() {

        return sc.nextLong();
    }

    static double nd() {

        return sc.nextDouble();
    }

    static String n() {

        return sc.next();
    }

    static char[] nc() {

        return sc.next().toCharArray();
    }

    static int kaijo(int n) {

        if (n == 0 || n == 1) {
            return 1;
        } else {
            return n * kaijo(n - 1);
        }
    }

    static int fib(int n) {

        return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
    }

    static long lcm(long m, long n) {

        return m * n / gcd(m, n);
    }

    static int lcm(int m, int n) {

        return m * n / gcd(m, n);
    }

    static long gcd(long a, long b) {

        return (b == 0) ? a : gcd(b, a % b);
    }

    static int gcd(int a, int b) {

        return (b == 0) ? a : gcd(b, a % b);
    }

    static void out(String info) {

        System.out.println(info);
    }

    static void out(int info) {

        System.out.println(info);
    }

    static void out(double info) {

        System.out.println(info);
    }

    static void out(long info) {

        System.out.println(info);
    }

    static void out(char info) {

        System.out.println(info);
    }

    static void out(Object obj) {

        System.out.println(obj.toString());
    }

    static void outn(String info) {

        System.out.print(info);
    }

    static void outn(int info) {

        System.out.print(info);
    }

    static void outn(double info) {

        System.out.print(info);
    }

    static void outn(long info) {

        System.out.print(info);
    }

    static void outn(char info) {

        System.out.print(info);
    }

    static double max(double d, double e) {

        return Math.max(d, e);
    }

    static long max(long a, long b) {

        return Math.max(a, b);
    }

    static double min(double d, double e) {

        return Math.min(d, e);
    }

    static long min(long a, long b) {

        return Math.min(a, b);
    }
} public class Main {

    public static String Y = "Yes";
    public static String N = "No";
    public static long MOD = (long) (Math.pow(10, 9) + 7);
    public static Scanner sc = new Scanner(System.in);

    public static void main(String[] args) {

        int n = ni();
        int a = ni();
        int b = ni();

        int count = 0;

        for (int i = 1; i <= n; i++) {
            int sum = ketaSum(i);

            if (sum <= b && sum >= a) {
                count += i;
            }
        }
        out(count);

    }

    /*
     * 以下メソッド集
     */

    static int ketasuu(int n) {

        String str = "" + n;
        return str.length();
    }

    static int ketaSum(int n) {

        String str = "" + n;
        int sum = 0;
        for (int i = 0; i < str.length(); i++) {
            sum += Integer.parseInt(str.substring(i, i + 1));
        }
        return sum;
    }

    static int abcount(String str) {

        int count = 0;
        int len = str.length();
        for (int i = 0; i < len - 1; i++) {
            if ("AB".equals(str.substring(i, i + "AB".length()))) {
                count++;
            }
        }
        return count;
    }

    static int ni() {

        return sc.nextInt();
    }

    static long nl() {

        return sc.nextLong();
    }

    static double nd() {

        return sc.nextDouble();
    }

    static String n() {

        return sc.next();
    }

    static char[] nc() {

        return sc.next().toCharArray();
    }

    static int kaijo(int n) {

        if (n == 0 || n == 1) {
            return 1;
        } else {
            return n * kaijo(n - 1);
        }
    }

    static int fib(int n) {

        return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
    }

    static long lcm(long m, long n) {

        return m * n / gcd(m, n);
    }

    static int lcm(int m, int n) {

        return m * n / gcd(m, n);
    }

    static long gcd(long a, long b) {

        return (b == 0) ? a : gcd(b, a % b);
    }

    static int gcd(int a, int b) {

        return (b == 0) ? a : gcd(b, a % b);
    }

    static void out(String info) {

        System.out.println(info);
    }

    static void out(int info) {

        System.out.println(info);
    }

    static void out(double info) {

        System.out.println(info);
    }

    static void out(long info) {

        System.out.println(info);
    }

    static void out(char info) {

        System.out.println(info);
    }

    static void out(Object obj) {

        System.out.println(obj.toString());
    }

    static void outn(String info) {

        System.out.print(info);
    }

    static void outn(int info) {

        System.out.print(info);
    }

    static void outn(double info) {

        System.out.print(info);
    }

    static void outn(long info) {

        System.out.print(info);
    }

    static void outn(char info) {

        System.out.print(info);
    }

    static double max(double d, double e) {

        return Math.max(d, e);
    }

    static long max(long a, long b) {

        return Math.max(a, b);
    }

    static double min(double d, double e) {

        return Math.min(d, e);
    }

    static long min(long a, long b) {

        return Math.min(a, b);
    }
} Main
import java.util.Scanner;


public class Main {

    public static String Y = "Yes";
    public static String N = "No";
    public static long MOD = (long) (Math.pow(10, 9) + 7);
    public static Scanner sc = new Scanner(System.in);

    public static void main(String[] args) {

        int n = ni();
        int a = ni();
        int b = ni();

        int count = 0;

        for (int i = 1; i <= n; i++) {
            int sum = ketaSum(i);

            if (sum <= b && sum >= a) {
                count += i;
            }
        }
        out(count);

    }

    /*
     * 以下メソッド集
     */

    static int ketasuu(int n) {

        String str = "" + n;
        return str.length();
    }

    static int ketaSum(int n) {

        String str = "" + n;
        int sum = 0;
        for (int i = 0; i < str.length(); i++) {
            sum += Integer.parseInt(str.substring(i, i + 1));
        }
        return sum;
    }

    static int abcount(String str) {

        int count = 0;
        int len = str.length();
        for (int i = 0; i < len - 1; i++) {
            if ("AB".equals(str.substring(i, i + "AB".length()))) {
                count++;
            }
        }
        return count;
    }

    static int ni() {

        return sc.nextInt();
    }

    static long nl() {

        return sc.nextLong();
    }

    static double nd() {

        return sc.nextDouble();
    }

    static String n() {

        return sc.next();
    }

    static char[] nc() {

        return sc.next().toCharArray();
    }

    static int kaijo(int n) {

        if (n == 0 || n == 1) {
            return 1;
        } else {
            return n * kaijo(n - 1);
        }
    }

    static int fib(int n) {

        return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
    }

    static long lcm(long m, long n) {

        return m * n / gcd(m, n);
    }

    static int lcm(int m, int n) {

        return m * n / gcd(m, n);
    }

    static long gcd(long a, long b) {

        return (b == 0) ? a : gcd(b, a % b);
    }

    static int gcd(int a, int b) {

        return (b == 0) ? a : gcd(b, a % b);
    }

    static void out(String info) {

        System.out.println(info);
    }

    static void out(int info) {

        System.out.println(info);
    }

    static void out(double info) {

        System.out.println(info);
    }

    static void out(long info) {

        System.out.println(info);
    }

    static void out(char info) {

        System.out.println(info);
    }

    static void out(Object obj) {

        System.out.println(obj.toString());
    }

    static void outn(String info) {

        System.out.print(info);
    }

    static void outn(int info) {

        System.out.print(info);
    }

    static void outn(double info) {

        System.out.print(info);
    }

    static void outn(long info) {

        System.out.print(info);
    }

    static void outn(char info) {

        System.out.print(info);
    }

    static double max(double d, double e) {

        return Math.max(d, e);
    }

    static long max(long a, long b) {

        return Math.max(a, b);
    }

    static double min(double d, double e) {

        return Math.min(d, e);
    }

    static long min(long a, long b) {

        return Math.min(a, b);
    }
}


class XY {

    int h;
    int c;

    XY(int h, int c) {
        this.h = h;
        this.c = c;
    }
}
