# import bisect
# from collections import Counter, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

if __name__ == '__main__':
    main() import sys sys ipti = sys.stdin.readline ipti sys.stdin.readline sys.stdin sys stdin readline MOD = 10 ** 9 + 7 MOD 10 ** 9 + 7 10 ** 9 10 9 7 INF = float('INF') INF float('INF') float 'INF' sys.setrecursionlimit(10 ** 5) sys.setrecursionlimit sys setrecursionlimit 10 ** 5 10 5 def main():
    x, a = list(map(int,ipti().split()))
    print(0) if x < a else print(10) main x, a = list(map(int,ipti().split())) x list(map(int,ipti().split())) list map(int,ipti().split()) map int ipti().split() ().split () ipti split a print(0) if x < a else print(10) x < a x a print(0) print 0 print(10) print 10 if __name__ == '__main__':
    main() __name__ == '__main__' __name__ '__main__' main() main INF = float('INF') float('INF') INF ipti = sys.stdin.readline sys.stdin.readline ipti MOD = 10 ** 9 + 7 10 ** 9 + 7 MOD def main():
    x, a = list(map(int,ipti().split()))
    print(0) if x < a else print(10) def main():
    x, a = list(map(int,ipti().split()))
    print(0) if x < a else print(10) main
# import bisect
# from collections import Counter, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

if __name__ == '__main__':
    main()