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().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())
print(0 if x < a else 10)

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

mi = lambda: map(int, input().split())

X, A = mi()

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

Solution (Python):
import sys

inf = 10 ** 18

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

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

Solution (Python):
import sys

ns = lambda: sys.stdin.readline().rstrip()
ni = lambda: int(ns())
nm = lambda: map(int, sys.stdin.readline().split())
nl = lambda: list(nm())
nsm = lambda: map(str, sys.stdin.readline().split())
nsl = lambda: list(nsm())


x, a = nm()
if x < a:
    print(0)
else:
    print(10)

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

"""
AtCoder A
"""

import sys, math, random
import numpy as np








inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LLS(): return [list(sys.stdin.readline().rstrip()) for _ in sys.stdin.readlines()]
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 I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()



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


abc()

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 sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
Max = sys.maxsize
def l():
    return list(map(int,input().split()))
def m():
    return map(int,input().split())
def onem():
    return int(input())
def s(x):
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa == x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x):
    return " ".join(map(str,x))

x,c = m()

if x < c:
    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 copy
import random
import bisect 
import fractions 
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) 

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

print(ans)

Solution (Python):

import sys


def solve(X: int, A: int):
    if X < A:
        ret = 0
    else:
        ret = 10
    print(ret)
    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):
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(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 = 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())
print(0) if X < A 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):
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(10)
else:
  print(0)

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


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def SI(): return input()


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


main()

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

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

Solution (Python):
import sys, re




from copy import deepcopy,copy




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 = [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,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
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(10)
else:
    print(0)

Solution (Python):
a, p = map(int, input().split())
if a < p:
    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):
X, A = map(int, input().split())
if X < A:
	print(0)
else:
	print(10)

Solution (Python):
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())
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())
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(10*int(bool(x >= a)))

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

print(0 if x < a else 10)

Solution (Python):
X,A = (int(x) for x in input().split())

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

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

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

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

x, a = li()

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








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

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

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

Solution (Python):
X, A = map(int, input().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):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import random
input = sys.stdin.readline






















def main():

	
	X, A = map(int, input().split(" "))

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



if __name__ == "__main__":
	main()

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]

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

















input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())






























































if __name__ == '__main__':

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

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

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

Solution (Python):
x,a  = list(map(lambda x: int(x),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:
  ans = 10
print(ans)

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)
    return 0

main()

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

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

Solution (Python):

import re
import bisect
from datetime import datetime as dt
import bisect
import math

def gcd(a, b):
    return math.gcd(a, b)

def lcm(a, b):
    return a * b / gcd(a, b)

class slist(list):
    def __init__(self, *args, **kw):
        list.__init__(self, *args, **kw)
        self.sort()

    def append(self, value):
        bisect.insort(self,value)

    def index_left(self, value):
        return bisect.bisect_left(self, value)


if __name__ == '__main__':
    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(a) for a 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,input().split())
print([0, 10][x>=a])

Solution (Python):


import sys
def input(): return sys.stdin.readline().strip()



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 = 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 makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]






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

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

Solution (Python):
N = list(map(int, input().split()))
if N[0]<N[1]:
    print(0)
else:
    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


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




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



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):
def getLnInput():
    return input().split()

x, a = map(int, getLnInput())
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=list(map(int,input().split()))
if a[0]>=a[1]:
    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())
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()))

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

Solution (Python):
X, A = map(int, input().split())
print(10 if X>=A else 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):
import sys
input=sys.stdin.readline
from collections import deque
from heapq import heappush,heappop
import re

def int_raw():
    return int(input())
 
def ss_raw():
    return input().split()
 
def ints_raw():
    return tuple(map(int, ss_raw()))


def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


DIV = 10**9+7

def ncr(n, r, mod=DIV):
	r = min(r, n-r)
	ret = 1
	for i in range(1, r+1):
		ret = ret * (n-i+1) % mod
		ret = ret * mod_inv(i, mod) % mod
	return ret


def main():
    ans =0
    X,A = ints_raw()

    return 0 if X<A else 10

print(main())

Solution (Python):
a,b=input().split()
a=int(a)
b=int(b)
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):
def read():
    X, A = list(map(int, input().strip().split()))
    return X, A


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


if __name__ == '__main__':
    inputs = read()
    print("%d" % solve(*inputs))

Solution (Python):

import sys
INF = float("inf")


def solve(X: int, A: int):
    if X < A:
        print(0)
    else:
        print(10)
    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())
print(0 if X<A else 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)
if X >= A:
    print(10)

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

Solution (Python):
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

def s(generator, splitter, mapper):
    return [ mapper(s) for s in generator().split(splitter) ]


def get_nums_l():
    return [ int(s) for s in input().split(" ")]


def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

x,a = get_nums_l()

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

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 = (int(_) for _ in input().split())

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

Solution (Python):

import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    x,a = f()

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

solve()

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

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

Solution (Python):
x, n = map(int, input().split())
print(0 if x < n 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')
elif X >= A:
    print('10')

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

Solution (Python):
from heapq import heappush, heappop, heapify, heapreplace
from collections import defaultdict


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

if __name__ == '__main__':
    Solution().main()

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


def main():
    a, b = map(int, raw_input().split())
    if a < b:
        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())
print(0 if X < A else 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 collections import deque  
from collections import defaultdict  
from heapq import heapify, heappush, heappop, heappushpop  
from bisect import bisect_left, bisect_right  



s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    X, A = i2nn()
    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 = 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 = list(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())

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())
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 = 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):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7

def LI(): return list(map(int,input().split()))
def I(): return int(input())
def LS(): return input().split()
def S(): return input()

def main():
  x,a=LI()

  if x<a:
    return 0
  else:
    return 10

print(main())

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

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
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 I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)

def main():
    x,a = LI()
    if x < a:
        return 0

    return 10


print(main())

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())
print(0 if x < a else 10)

Solution (Python):

import sys
def input(): return sys.stdin.readline().rstrip()
def mi(): return map(int, input().split())


x, a = mi()

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

print(10 if x >= y else 0)