Problem:
 Score : 100 points    Problem Statement X and A are integers between 0 and 9 (inclusive).  If X is less than A , print 0 ; if X is not less than A , print 10 .      Constraints  0 \leq X, A \leq 9  All values in input are integers.         Input Input is given from Standard Input in the following format:  X  A       Output If X is less than A , print 0 ; if X is not less than A , print 10 .        Sample Input 1 3 5      Sample Output 1 0  3 is less than 5 , so we should print 0 .       Sample Input 2 7 5      Sample Output 2 10  7 is not less than 5 , so we should print 10 .       Sample Input 3 6 6      Sample Output 3 10  6 is not less than 6 , so we should print 10 .

Solution (Python):

from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip

import random
import collections
import math
import itertools
import bisect

def real_main():
    x, a = read_int_array()
    if x < a:
        print(0)
    else:
        print(10)


def solve():
    pass


def main():
    if False and 'PYCHARM_HOSTED' in os.environ:
        main_pycharm()
    else:
        real_main()


from copy import deepcopy
def main_pycharm():
    solution = solve

    test_inputs = None
    test_outputs = None
    judge = None
    slow_solution = None
    if solution is not None:
        if test_outputs is not None:
            test_with_answers(solution, test_inputs, test_outputs)
        if judge is not None:
            test_with_judge(solution, test_inputs, judge)
        if slow_solution is not None:
            test_with_slow_solution(solution, test_inputs, slow_solution)


def test_with_answers(solution, inputs_answers):
    total, wrong = 0, 0
    for args, test_ans in inputs_answers:
        ans = solution(*args.copy())
        if ans != test_ans:
            print('WRONG! ans=%s, test_ans=%s, args=%s' % (ans, test_ans, args))
            wrong += 1
        else:
            print('GOOD')
        total += 1
    print('ALL %d TESTS PASSED' % total if not wrong else '%d out of %d tests are WRONG' % (wrong, total))


def test_with_judge(solution, inputs_gen, judge):
    total, wrong = 0, 0
    for args in inputs_gen:
        ans = solution(*deepcopy(args))
        if not judge(deepcopy(ans), *deepcopy(args)):
            print('WRONG! ans=%s, args=%s' % (ans, args))
            wrong += 1
        total += 1
    print('ALL %d TESTS PASSED' % total if not wrong else '%d out of %d tests are WRONG' % (wrong, total))


def test_with_slow_solution(solution, inputs_gen, solution_slow):
    total, wrong = 0, 0
    for args in inputs_gen:
        ans = solution(*deepcopy(args))
        slow = solution_slow(*deepcopy(args))
        if ans != slow:
            print('WRONG! ans=%s, slow=%s, args=%s' % (ans, slow, args))
            wrong += 1
        total += 1
    print('ALL %d TESTS PASSED' % total if not wrong else '%d out of %d tests are WRONG' % (wrong, total))




BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")

def read():
    return input()

def read_int():
    return int(input())

def read_array(sep=None, maxsplit=-1):
    return input().split(sep, maxsplit)

def read_int_array():
    return [int(a) for a in read_array()]



if __name__ == "__main__":
    main()

Solution (Python):
X,A=(int(x) for x in input().split())
if X<A:
    print(0)
else:
    print(10)

Solution (Python):
x,a = map(int, input().split())

print(0 if x<a else 10)

Solution (Python):
X,A = list(map(int,input().split()))

if X<A:
    print(0)
else:
    print(10)

Solution (Python):
X, A = map(int, input().split())
if X < A:
    print(0)
else:
    print(10)

Solution (Python):
x,a = map(int,input().split())
if x < a:
  print(0)
else:
  print(10)

Solution (Python):
x,a = map(int, input().split())
if x < a:
  print(0)
else:
  print(10)

Solution (Python):
X, A = map(int, input().split())
print(0 if X < A else 10)

Solution (Python):
X,A = map(int,input().split())
if X<A:
    print(0)
else:
    print(10)

Solution (Python):
x,a = map(int, input().split())
print(0 if x < a else 10)

Solution (Python):
X, A = [int(i) for i in input().split()]
if X < A:
    print(0)
else:
    print(10)

Solution (Python):
X,A = [int(x) for x in input().split()]
if(X<A):
    print(0)
else:
    print(10)

Solution (Python):
x, a = map(int, input().split())
if x < a:
    print(0)
else:
    print(10)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X, A = MAP()

if X < A:
	print(0)
else:
	print(10)

Solution (Python):
X, A = map(int,input().split())
if X < A:
    print("0")
else:
    print("10")

Solution (Python):
A, B = map(int, input().split())
if (A >= B):
  print(10)
else:
  print(0)

Solution (Python):
X, A = map(int,input().split())
if (X < A):
  print(0)
else:
  print(10)

Solution (Python):

x, a = map(int, input().split())
print(0 if x < a else 10)

Solution (Python):
x, a = map(int, input().split())
if x < a:
    print(0)
else:
    print(10)

Solution (Python):
x, a = map(int, input().split())

if x < a:
    print(0)
else:
    print(10)

Solution (Python):
X, A = map(int, input().split())

if X < A:
	print(0)
else:
	print(10)

Solution (Python):
X, A = map(int, input().split())
if X < A:
    print(0)
else:
    print(10)

Solution (Python):
x, a = (int(i) for i in input().split())

if x<a:
    print(0)
else:
    print(10)

Solution (Python):
x, a = map(int,input().split())
if x < a:
  print(0)
else:
  print(10)

Solution (Python):
X,A = map(int,input().split())
print(0 if X < A else 10)

Solution (Python):
X,A = map(int,input().split())
if X<A:print(0)
else: print(10)

Solution (Python):
x,a = map(int,input().split())
if x < a:
    print("0")
else:
    print("10")

Solution (Python):
X,A = map(int,input().split())
if X<A:
    print(0)
else:
    print(10)

Solution (Python):
x, a = map(int, input().split())
if x < a:
    print(0)
else:
    print(10)

Solution (Python):
x, a = map(int, input().split())

if x < a:
    print('0')
else:
    print('10')

Solution (Python):
X , A = map(int,input().split())

if X < A :
    print(0)
else :
    print(10)

Solution (Python):
X, A = map(int, input().split())

if X < A:
    print(0)
else:
    print(10)

Solution (Python):




 
from collections import* 
from fractions import gcd
from functools import* 
from itertools import* 
from operator import mul,itemgetter
from bisect import* 
from heapq import* 
from math import factorial,pi
from copy import deepcopy
import sys
sys.setrecursionlimit(10**8)


a,b=map(int,input().split())
if a<b:
    print(0)
else:
    print(10)

Solution (Python):
X,A = map(int,input().split())
print(10 if X>=A else 0)

Solution (Python):
X, A = list(map(int, input().split()))
if X < A:
  print(0)
else:
  print(10)

Solution (Python):
x, a = map(int, input().split())
if x < a:
	print(0)
else:
	print(10)

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007


def A():
    x,n = LI()
    if x < n:
        print(0)
    else:
        print(10)
    return


def B():
    n = I()

    return


def C():
    n = I()

    return


def D():
    n = I()

    return


def E():
    n = I()

    return


def F():
    n = I()

    return


if __name__ == "__main__":
    A()

Solution (Python):
import sys
input = sys.stdin.readline
ri = lambda: int(input())


rl = lambda: map(int,input().split())
rr = lambda N: [list(l) for l in zip(*[rl() for _ in range(N)])]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18
MOD = 10**9+7

X,A = rl()
print(0 if X<A else 10)

Solution (Python):
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import string
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")



X, A = list(map(int, sys.stdin.readline().split()))
if X < A:

    print(0)
else:
    print(10)

Solution (Python):
X,A = map(int,input().split())
print(0 if X<A else 10)

Solution (Python):
X,A = map(int, input().split())

if X < A:
    print(0)
else:
    print(10)

Solution (Python):
x,a=map(int,input().split())
print(0 if x<a else 10)

Solution (Python):
import sys
from fractions import gcd
from itertools import groupby as gb
from itertools import permutations as perm
from itertools import combinations as comb
from collections import Counter as C
from collections import defaultdict as dd
sys.setrecursionlimit(10**5)
def y(f):
    if f:
        print('Yes')
    else:
        print('No')
def Y(f):
    if f:
        print('YES')
    else:
        print('NO')

x, a = map(int,input().split())
if x < a:
    print(0)
else:
    print(10)

Solution (Python):
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

X, A = nl()

if X < A:
    print(0)
else:
    print(10)

Solution (Python):
x, a = list(map(int, input().split()))
if x<a:
  print(0)
else:
  print(10)

Solution (Python):
X,A = map(int, input().split())

if X < A:
    print(0)
else:
    print(10)

Solution (Python):
x,a = map(int,input().split())
print(0 if x < a else 10)

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def YesNo(x): return 'Yes' if x else 'No'
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()

def main():
    X, A = LI()
    ans = 0 if X < A else 10
    return ans

print(main())

Solution (Python):
x,a = map(int,input().split())

if x < a :
    print(0)
else :
    print(10)

Solution (Python):
x,a=map(int,input().split())
if x<a:
  print(0)
else:
  print(10)