x, a = map(int, input().split())
print('0') if x < a else print('10')
cons = 10 ** 7
def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]
primes(cons) x, a = map(int, input().split()) x map(int, input().split()) map int input().split() ().split () input split a print('0') if x < a else print('10') x < a x a print('0') print '0' print('10') print '10' cons = 10 ** 7 cons 10 ** 7 10 7 def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]] primes is_prime = [True] * (n + 1) is_prime [True] * (n + 1) [True] True n + 1 n 1 is_prime[0] = False is_prime[0] is_prime 0 False is_prime[1] = False is_prime[1] is_prime 1 False for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
     i range(2, int(n**0.5) + 1) range 2 int(n**0.5) + 1 int(n**0.5) int n**0.5 n 0.5 1 if not is_prime[i]:
            continue
         not is_prime[i] is_prime[i] is_prime i continue for j in range(i * 2, n + 1, i):
            is_prime[j] = False
     j range(i * 2, n + 1, i) range i * 2 i 2 n + 1 n 1 i is_prime[j] = False is_prime[j] is_prime j False i for i in range(n + 1) if is_prime[i] for i in range(n + 1) if is_prime[i] i range(n + 1) range n + 1 n 1 is_prime[i] is_prime i if is_prime[i] i return [i for i in range(n + 1) if is_prime[i]] [i for i in range(n + 1) if is_prime[i]] n n primes(cons) primes cons x, a = map(int, input().split()) map(int, input().split()) x a = map(int, input().split()) map(int, input().split()) a cons = 10 ** 7 10 ** 7 cons def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]] def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]] primes
x, a = map(int, input().split())
print('0') if x < a else print('10')
cons = 10 ** 7
def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]
primes(cons)