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):



X, A = map(int, input().rstrip().split(' '))

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

Solution (Python):
def main():
    n = [int(i) for i in input().split()]
    if n[0] < n[1]:
        print(0)
    else:
        print(10)


if __name__ == "__main__":
    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)

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

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

Solution (Python):
m, n = [int(i) for i in input().split()]
if(m >= n):
  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 = (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())
if x < a:
    print("0")
else:
    print("10")

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

if X >= A: 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())
ans = 0 if x<a else 10
print(ans)

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())

ans = 0 if x<a else 10

print(ans)

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

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

Solution (Python):
read = input 
rn = lambda :list(map(int, read().split()))
x,a = rn()
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(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):
X, A = map(int, input().split())

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

Solution (Python):

import sys


def solve(X: int, A: int):
    if X >= A:
        print(10)
    else:
        print(0)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  
    A = int(next(tokens))  
    solve(X, A)

if __name__ == '__main__':
    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)

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):

def main():
    buf = input()
    buflist = buf.split()
    X = int(buflist[0])
    A = int(buflist[1])
    if X < A:
        print(0)
    else:
        print(10)

if __name__ == '__main__':
    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)

if x >= a:
  print(10)

Solution (Python):

"""



"""
import sys


def solve(X, A):
    if X < A:
        return 0
    return 10


def main(args):
    X, A = map(int, input().split())
    ans = solve(X, A)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

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):
a, b = map(int, input().split())
if a < b:
  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):
XA = [int(i) for i in input().split()]
answer = -1
if(XA[0] < XA[1]):
    answer = 0
else:
    answer = 10
print(answer)

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

Solution (Python):




import math
import statistics

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

Solution (Python):
a,b=map(int,input().split())
print('0' if a<b 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())
ans=0 if x<a  else 10



print(ans)

Solution (Python):


import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
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):
x,a=map(int,input().split())
if x<a:
    print(0)
else:
    print(10)

Solution (Python):
p = input().split()
x,a = int(p[0]),int(p[1])
if x < a:
    print(0)
else:
    print(10)

Solution (Python):


a,b = map(int,input().split())
if a < b:
    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):
x, a = map(int,input().split())
if x < a:
  print("0")
else:
  print("10")

Solution (Python):
n, k = list(map(int, input().split()))

if n < k:
  print(0)
else:
  print(10)

Solution (Python):
import math


n, m = [int(i) for i in input().split()]








if (n < m) :
    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()]

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):



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


if __name__ == "__main__":
    main()

Solution (Python):
a,b = list(map(int, input().split()))
if(a>=b):
  print("10")
else:
  print("0")

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

Solution (Python):
words = lambda t : list(map(t, input().split()))
x,a = words(int)
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):
import sys
sys.setrecursionlimit(10**7)
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 sys.stdin.readline().strip()
INF = 10 ** 18
MOD = 10 ** 9 + 7

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 7)

debug = True


def dprint(*objects):
    if debug == True:
        print(*objects)







def solve():
    x, a = map(int, input().split())\

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

solve()

Solution (Python):
a = input().split()

if a[0] < a[1]:
  print(0)
else:
  print(10)

Solution (Python):
X,A=map(int,input().split())
if X>=A:
    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 = [int(i) for i in input().split()]
print(0 if X < A else 10)

Solution (Python):




x, a = map(int,input().split())


if x < a:
    ans = 0
else:
    ans = 10


print(ans)

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(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):
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):
import sys
from collections import Counter, deque, defaultdict





sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7






X, A = [int(x) for x in input().split()]


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

Solution (Python):

"""
Created on Sun Jun 16 20:55:03 2019

@author: Yamazaki Kenichi
"""

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):
n,m=map(int,input().split())
if n<m:print(0)
else:print(10)

Solution (Python):
(N,M) = (int(i) for i in input().split(" "))
print(0 if N < M else 10)

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

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

Solution (Python):
from itertools import combinations
import sys
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
MOD = 1000000007
def POW(x, y): return pow(x, y, MOD)
def INV(x, m=MOD): return pow(x, m - 2, m)
def DIV(x, y, m=MOD): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())

X,A=LI()
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 = input().split()
print(0) if x < a 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())

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):
def main():
    x,a = map(int,input().split(' '))
    if x < a:
        print(0)
    else:
        print(10)

if __name__=='__main__':
    main()

Solution (Python):
from bisect import bisect_left, bisect_right; from collections import Counter, defaultdict, deque, OrderedDict; from copy import deepcopy; from fractions import gcd; from functools import lru_cache, reduce; from math import ceil, floor; from sys import stdin, setrecursionlimit
import heapq as hq; import itertools as its; import operator as op



inf = float('inf')
input = stdin.readline


def main():
    x, a = get_li()
    if x < a:
        print(0)
    else:
        print(10)
    return


def get_int():
    return int(input())


def get_float():
    return float(input())


def get_str():
    return input().strip()


def get_li():
    return [int(i) for i in input().split()]


def get_lf():
    return [float(f) for f in input().split()]


def get_lc():
    return list(input().strip())


def get_data(n, types, sep=None):
    if len(types) == 1:
        return [types[0](input().strip()) for _ in range(n)]
    return list(zip(*(
        [t(x) for t, x in zip(types, input().strip().split(sep=sep))]
        for _ in range(n)
    )))


if __name__ == '__main__':
    setrecursionlimit(4100000)
    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("10")
else:
  print("0")

Solution (Python):
X,A=[int(i) for i in input().split(" ")]

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

Solution (Python):
hoge = input().split()
x = int(hoge[0])
a = int(hoge[1])

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

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

Solution (Python):
line = input().split()
if int(line[0])<int(line[1]):
  print(0)
else:
  print(10)

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

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

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

print(10 if a<=x else 0)

Solution (Python):



def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def main():
    x, a = rli()
    if x < a:
        print(0)
    else:
        print(10)


if __name__ == '__main__':
    main()

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):
str = input()

X = int(str.split()[0])
A = int(str.split()[1])
if (X < A):
	s = 0
else :
	s = 10

print("{}".format(s))

Solution (Python):
ans = 0
n, k = [ int(v) for v in input().split() ]
if n >= k:
	ans += 10
print(ans)

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

Solution (Python):
import sys

input = sys.stdin.readline

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):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

x, a = na()
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 = list(map(int,input().split()))

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

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

Solution (Python):
from sys import stdin
X,A = [int(x) for x in stdin.readline().rstrip().split()]
if X < A:
    print(0)
else:
    print(10)

Solution (Python):
def main():
    x, a = [int(val) for val in input().split()]
    print(0 if x < a else 10)


if __name__ == '__main__':
    main()

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

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

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())
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())
print(0 if X < A else 10)

Solution (Python):

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

Solution (Python):
H,W = map(int,input().split(' '))
if H<W:
    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):
xa = list(map(int, list(input().split())))
x = xa[0]
a = xa[1]

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

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

Solution (Python):
from sys import exit

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)
if X >= A:
    print(10)

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

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

Solution (Python):


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

if __name__ == '__main__':
    main()

Solution (Python):
import sys
from operator import itemgetter
from collections import deque

input = sys.stdin.readline

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):




def solve():
    X, A = list(map(int, input().split()))
    if X < A:
        return 0
    return 10


def main():
    print(solve())


if __name__ == "__main__":
    main()

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

Solution (Python):
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline



def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [X, A] = [int(input_raw[0]), int(input_raw[1])]
    if X < A:
        print 0
    else:
        print 10
if __name__ == '__main__':
    main()

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, raw_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):
def main():
    X, A = map(int, input().split())
    if X >= A:
        print(10)
    else:
        print(0)


main()

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

Solution (Python):











import sys
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
inf=float('inf')
mod = 10**9+7
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    X, A = MI()
    if X < A:
        print(0)
    else:
        print(10)
if __name__ == '__main__':
    main()

Solution (Python):
l = input().split()
X = int(l[0])
A = int(l[1])

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

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

Solution (Python):
import sys
import math 
ni = lambda: int(ns())
na = lambda: list(map(int, input().split()))
ns = lambda: input()

X,A = na()

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

Solution (Python):

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

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

Solution (Python):
def inverse(a):
    return pow(a, mod - 2, mod)


def usearch(x, a):
    lft = 0
    rgt = len(a) + 1
    while rgt - lft > 1:
        mid = (rgt + lft) // 2
        if a[mid] <= x:
            lft = mid
        else:
            rgt = mid
    return lft


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



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)

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

Solution (Python):
x,a = list(map(int,input().split()))
if x < a:
    print(0)
elif x >= a:
    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 = list(map(int, input().split()))

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

Solution (Python):
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))

x, a = getList()
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 = list(map(int, input().split()))
if x < a:
    print(0)
else:
    print(10)

Solution (Python):
import sys

input = sys.stdin.readline

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

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline


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


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(X, A):
    return 0 if X < A else 10


def main():
    X, A = read_int_n()
    print(slv(X, A))


if __name__ == '__main__':
    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)

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):
import math
import copy
from operator import mul
from functools import reduce
from collections import defaultdict
from collections import Counter
from collections import deque

from itertools import product

from itertools import permutations

from itertools import combinations

from itertools import accumulate
from bisect import bisect_left, bisect_right





def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]
 
def i_inpl(): return int(input())
def l_inpl(): return list(map(int, input().split()))
INF = float("inf")



X, A = l_inpl()

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):


def gcd_core(a, b):
    if b == 0:
        return a
    else:
        return gcd_core(b, a % b)


def gcd(arr):
    g = gcd_core(arr[0], arr[1])
    for i in range(2, len(arr)):
        g = gcd_core(g, arr[i])
    return g

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):
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())
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):
x,a = map(int,input().split())

if x >= a:
    print(10)
else:
    print(0)

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

Solution (Python):
n, k = map(int, input().split())
if n<k: 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)
elif X >= A:
    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):
import collections
import itertools

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):
import sys,collections,math,random;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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