from collections import deque

from collections import Counter

from itertools import product, permutations,combinations

from operator import itemgetter

from heapq import heappop, heappush

from bisect import bisect_left, bisect_right, bisect

#pypyではscipy, numpyは使えない

#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree

#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix

#import numpy as np

from fractions import gcd

from math import ceil,floor, sqrt, cos, sin, pi, factorial

import sys

read = sys.stdin.buffer.read

readline = sys.stdin.buffer.readline

readlines = sys.stdin.buffer.readlines

sys.setrecursionlimit(10**8)

INF = float('inf')



def main():

  x, a = list(map(int, readline().split()))

  if x<a:

    print((0))

  else:

    print((10))

  

  

  

  

  

if __name__ == '__main__':

  main()
import sys

readline = sys.stdin.buffer.readline

sys.setrecursionlimit(10 ** 8)

INF = float('inf')

MOD = 10 ** 9 + 7



def main():

    X, A = list(map(int, readline().split()))

    if X<A:

        print('0')

    else:

        print('10')



if __name__ == '__main__':

    main()
from collections import deque
from collections import Counter
from itertools import product, permutations, combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect

# pypyではscipy, numpyは使えない
# from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
# from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
# import numpy as np
from fractions import gcd
from math import ceil, floor, sqrt, cos, sin, pi, factorial
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float("inf")


def main():
    x, a = list(map(int, readline().split()))
    if x < a:
        print((0))
    else:
        print((10))


if __name__ == "__main__":
    main()

import sys

readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10**8)
INF = float("inf")
MOD = 10**9 + 7


def main():
    X, A = list(map(int, readline().split()))
    if X < A:
        print("0")
    else:
        print("10")


if __name__ == "__main__":
    main()

-from collections import deque -from collections import Counter -from itertools import product, permutations, combinations -from operator import itemgetter -from heapq import heappop, heappush -from bisect import bisect_left, bisect_right, bisect - -# pypyではscipy, numpyは使えない -# from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree -# from scipy.sparse import csr_matrix, coo_matrix, lil_matrix -# import numpy as np -from fractions import gcd -from math import ceil, floor, sqrt, cos, sin, pi, factorial -read = sys.stdin.buffer.read -readlines = sys.stdin.buffer.readlines +MOD = 10**9 + 7 -    x, a = list(map(int, readline().split())) -    if x < a: -        print((0)) +    X, A = list(map(int, readline().split())) +    if X < A: +        print("0") -        print((10)) +        print("10")