Problem:
 Score: 100 points    Problem Statement  In AtCoder Kingdom, Gregorian calendar is used, and dates are written in the "year-month-day" order, or the "month-day" order without the year. For example, May 3 , 2018 is written as 2018 - 5 - 3 , or 5 - 3 without the year.  In this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5 - 5 is Takahashi. How many days from 2018 - 1 - 1 through 2018 - a - b are Takahashi?      Constraints   a is an integer between 1 and 12 (inclusive).  b is an integer between 1 and 31 (inclusive).  2018 - a - b is a valid date in Gregorian calendar.         Input  Input is given from Standard Input in the following format:  a  b       Output  Print the number of days from 2018 - 1 - 1 through 2018 - a - b that are Takahashi.        Sample Input 1 5 5      Sample Output 1 5  There are five days that are Takahashi: 1 - 1 , 2 - 2 , 3 - 3 , 4 - 4 and 5 - 5 .       Sample Input 2 2 1      Sample Output 2 1  There is only one day that is Takahashi: 1 - 1 .       Sample Input 3 11 30      Sample Output 3 11  There are eleven days that are Takahashi: 1 - 1 , 2 - 2 , 3 - 3 , 4 - 4 , 5 - 5 , 6 - 6 , 7 - 7 , 8 - 8 , 9 - 9 , 10 - 10 and 11 - 11 .

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

if a > b:
  print(a - 1)
else:
  print(a)

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

if a > b:
  print(a-1)
else:
  print(a)

Solution (Python):
a, b = map(int, input().split())
if a > b:
    print(a-1)
else:
    print(a)

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

if a<=b:
  print(a)
else:
  print(a-1)

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

print(a -1 if a > b else a)

Solution (Python):
a,b = map(int,input().split())
if b>=a:
  print(a)
else:
  print(a-1)

Solution (Python):
a,b=map(int,input().split())
if a>b:
  print(a-1)
else:
  print(a)

Solution (Python):
a, b = map(int, input().split())
print(a if b >= a else a-1)

Solution (Python):
a, b = map(int, input().split())
print(a if a <= b else a-1)

Solution (Python):
a, b = map(int, input().split())
if a <= b:
    print(a)
else:
    print(a-1)

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

if a<=b:
  print(a)
else:
  print(a-1)

Solution (Python):
a, b = map(int, input().split())
print(a if a<=b else a-1)

Solution (Python):
a,b=map(int,input().split())
if a>b:
    print(a-1)
else:
    print(a)

Solution (Python):
a,b=map(int,input().split())
print(a if a<=b else a-1)

Solution (Python):
a, b = map(int, input().split())
print(a if a <= b else a - 1)

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

print(a if a<=b else a-1)

Solution (Python):
a, b = [int(i) for i in input().split()]
     
print(a if a <= b else a - 1)

Solution (Python):
a, b = [int(i) for i in input().split()]
     
print(a if a <= b else a - 1)

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

if a>b:
  print(a-1)
else:
  print(a)

Solution (Python):
a,b = map(int,input().split())
if a <= b:
    print(a)
else:
    print(a - 1)

Solution (Python):
a, b = map(int, input().split())
print(a-1 if a > b else a)

Solution (Python):
a,b = map(int,input().split())
if b < a:
    print(a-1)
else:
    print(a)

Solution (Python):
a,b=map(int,input().split())
print(a-1) if a>b else print(a)

Solution (Python):
A,B=map(int,input().split())
print(A if A<=B else A-1)

Solution (Python):
a,b = map(int, input().split())
print(a-1 + int(a<=b))

Solution (Python):
a, b = map(int, input().split())
if a <= b:
    print(a)
if a > b:
    print(a-1)

Solution (Python):
a, b = map(int, input().split())
print((a - 1) + (a <= b))

Solution (Python):
a,b=map(int,input().split())
if a<=b:
    print(a)
else:
    print(a-1)

Solution (Python):
m, d= map(int, input().split())
if m <= d:
  print(m)
else:
  print(m - 1)

Solution (Python):
a, b = map(int, input().split())
if a <= b:
  print(a)
else:
  print(a-1)

Solution (Python):
from sys import stdin
A, B = [int(x) for x in stdin.readline().rstrip().split()] 
if B<A:
    A-=1;
print(A)

Solution (Python):
a, b = [int(i)  for i in input().split()]
  
if a <= b:
  print(a)
else:
  print(a-1)

Solution (Python):
a, b = map(int, input().split())
if a <= b:
  print(a)
else:
  print(a-1)

Solution (Python):
a, b = map(int, input().split())
if a > b:
    print(a - 1)
else:
    print(a)

Solution (Python):
a,b=map(int,input().split())
if a<b:
    print(a)
elif a==b:
    print(b)
else:
    print(a-1)

Solution (Python):
a,b=map(int,input().split())
if a>b:
    print(a-1)
else:
    print(a)

Solution (Python):
a,b=map(int,input().split())
if a>b:
    print(a-1)
else:
    print(a)

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

if b < a:
  print(a-1)
else:
  print(a)

Solution (Python):

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

print(a if a<=b else a-1)

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

Solution (Python):
a,b = map(int,input().split())
ans = 0

if a <= b:
    ans = a
else:
    ans = a-1

print(ans)

Solution (Python):

import sys
input = sys.stdin.readline









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

print(A if A<=B else A-1)

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b = mi()
    if a <= b:
      print(a)
    else:
      print(a - 1)


if __name__ == "__main__":
    main()

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

if a>b:
  print(a-1)
else:
  print(a)

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
count = a
if a > b:
  count -= 1
print(count)

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
count = a
if a > b:
  count -= 1
print(count)

Solution (Python):
a,b=map(int,input().split())
print(a-1+(a<=b))

Solution (Python):
a,b=map(int,input().split())
print(a-1+(b>=a))

Solution (Python):
a,b=map(int,input().split())
if a>b:
  print(a-1)
else:
  print(a)

Solution (Python):
a,b = map(int,input().split())
print( a-1 if a>b else a)

Solution (Python):
a, b = map(int, input().split())
print(a if a <= b else a - 1)

Solution (Python):
a,b = map(int,input().split())
if a>b:
    print(a-1)
else:
    print(a)

Solution (Python):
n,m = map(int,input().split())
if n<=m:
    print (n)
else:
    print (n-1)

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

if b>=a:
    print(a)
else:
    print(a-1)

Solution (Python):
x, y = map(int, input().split())
if x <= y:
    print(x)
else:
    print(x-1)

Solution (Python):
a, b  = map(int, input().split())
if a <= b:
    print(a)
else:
    print(a - 1)

Solution (Python):
a,b=map(int,input().split())
if a>b:
    a-=1
print(a)

Solution (Python):
a,b=map(int,input().split())
if a>b :
    print(a-1)
else :
    print(a)

Solution (Python):
a,b = map(int,input().split())
if a>b:
  a -= 1
print(a)

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

ans = a - 1
if a <= b:
    ans += 1

print(ans)

Solution (Python):
a,b = map(int,input().split())
print(a-1 if a > b else a)

Solution (Python):
a, b = map(int, input().split())
print(a-1 if a > b else a)

Solution (Python):
a, b = list(map(int, input().split()))
if a <= b:
    print(a)
else:
    print(a - 1)

Solution (Python):

import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left 
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pri = lambda x: print(*x, sep='\n')

N, K = map(int, input().split())

if N <= K:
    print(N)
else:
    print(N-1)

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

if (a<=b):
    print(a)
else:
    print(a-1)

Solution (Python):
a, b = [int(x) for x in input().split()]
print(a if a <= b else a - 1)

Solution (Python):
a,b = map(int, input().split())
if a <= b:
  print(a)
else:
  print(a-1)

Solution (Python):

a, b = map(int, input().split())
print(a - int(a > b))

Solution (Python):
def resolve():
	a, b = map(int, input().split())
	v = 0
	if a <= b:
		print(a)
	else:
		print(a-1)

resolve()

Solution (Python):
a,b=map(int,input().split())
if b>=a:
    print(a)
else:
    print(a-1)

Solution (Python):
a,b = map(int,input().split())
if b>=a:
    print(a)
else:
    print(a-1)

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

if a > b:
  print(a - 1)
elif a <= b:
  print(a)

Solution (Python):
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]





a, b = mi()

if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):
a,b = map(int,input().split())
ans = a-1
if a<=b:
    ans += 1
print(ans)

Solution (Python):
a, b = map(int, input().split())
if a <= b:
    print(a)
else:
    print(a - 1)

Solution (Python):

"""
Created on Wed May 13 17:17:53 2020

@author: shinba
"""

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

if a <= b:
    print(a)
else:
    print(a-1)

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

if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):
a, b = map(int, input().split())
if a <= b:
    print(a)
else:
    print(a - 1)

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


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





a,b = inputIL()

if a<=b:
  print(a)
else:
  print(a-1)

Solution (Python):
a,b=map(int,input().split())
if a<=b:
  print(a)
else:
  print(a-1)

Solution (Python):
a, b = map(int, input().split())
if b >= a:
  print(a)
else:
  print(a - 1)

Solution (Python):
a,b=map(int,input().split())
print(a if a<=b else a-1)

Solution (Python):
a,b=map(int,input().split())
print(a-(a>b))

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




print(a if a <= b else a - 1)

Solution (Python):
a, b = map(int, input().split())
print(a if a <= b else a -1)

Solution (Python):
a,b = map(int, input().split())
if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):
a, b = map(int, input().split())
ans = a - 1
if b >= a:
    ans += 1
print(ans)

Solution (Python):
a,b=map(int,input().split())
if a<=b:
    print(a)
else:
    print(a-1)

Solution (Python):
a, b = input().split()
ab = int(a + b)
ans = 0
if 11 <= ab:
    ans += 1
if 22 <= ab:
    ans += 1
if 33 <= ab:
    ans += 1
if 44 <= ab:
    ans += 1
if 55 <= ab:
    ans += 1
if 66 <= ab:
    ans += 1
if 77 <= ab:
    ans += 1
if 88 <= ab:
    ans += 1
if 99 <= ab:
    ans += 1
if 1010 <= ab:
    ans += 1
if 1111 <= ab:
    ans += 1
if 1212 <= ab:
    ans += 1
print(ans)

Solution (Python):
a, b = map(int, input().split())
if b >= a:
    print(a)
else:
    print(a-1)

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    a, b = map(int, input().split())

    ans = a - 1
    ans += 1 if a <= b else 0
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
def ABC_96_A():
    a,b = map(int, input().split())
    
    if a <= b:
        print(a)
    else:
        print(a-1)

if __name__ == '__main__':

    ABC_96_A()

Solution (Python):
a,b=map(int,input().split())
m=[0,2,0,1,0,1,0,0,1,0,1,0]
d=[31,30,28]
takahashi=0
for i in range(len(m)):
    for j in range(d[m[i]]):
        if i==j: takahashi+=1
        if a==i+1 and b==j+1: break
    if a==i+1: break
print(takahashi)

Solution (Python):
a, b = map(int, input().split())
print(a-1 if a > b else a)

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

if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):
a,b = map(int,input().split())
 
ans = a-1
 
for i in range(1,b+1):
  if a==i:
    ans = ans+1
    break
print(ans)

Solution (Python):
a,b=map(int,input().split())
if a>b:
    print(a-1)
else:
    print(a)

Solution (Python):
import sys
import math

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

Solution (Python):
a, b = map(int, input().split())
print(a if b >= a else a - 1)

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

if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):
def main():
    a,b = (int(x) for x in input().split())
    print(a if a<=b else a-1)

if __name__ == '__main__':
    main()

Solution (Python):
a, b = map(int, input().split())
print(a if b >= a else a-1)

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LS(): return list(sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))

a, b= LI()
if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi

a, b = ri_()
print(a - 1 if b < a else a)

Solution (Python):

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

if a > b:
  print(a-1)
else:
  print(a)

Solution (Python):
a,b = map(int,input().split())
if a > b:
    print(a-1)
else:
    print(a)

Solution (Python):
a,b=map(int,input().split())
if a<=b:
    print(a)
else:
    print(a-1)

Solution (Python):
a,b = map(int,input().split())
if a>b:
    print(a-1)
else:
    print(a)

Solution (Python):
a, b = map(int, input().split())
if a > b:
    print(a-1)
else:
    print(a)

Solution (Python):
a,b=map(int,input().split());print(a-1 if a>b else a)

Solution (Python):

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

print(a if b>=a else a-1)

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

if a <= b:
    print(a)
else:
    print(a - 1)

Solution (Python):
a,b = map(int,input().split())
print(a-1) if a > b else print(a)

Solution (Python):
a,b=map(int,input().split())
print(a-1+(b>=a))

Solution (Python):
a,b=map(int,input().split())
print(a if a<=b else a-1)

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

print(a if a<=b else a-1)

Solution (Python):
a,b = map(int,input().split())
if b >= a:
  print(a)
else:
  print(a-1)

Solution (Python):


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

if b < a:
    print(a-1)
else:
    print(a)

Solution (Python):
a,b=map(int,input().split())
c=a-1

if a <= b:
    print(c+1)
else:
    print(c)

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

if a <= b :
  print(a)
else:
  print(a-1)

Solution (Python):
a,b=map(int,input().split())
ans=a-(a>b)
print(ans)

Solution (Python):
a, b = map(int, input().split())
print(a if b>=a else a-1)

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

if a <= b:
    ans = a
else:
    ans = a - 1

print(ans)

Solution (Python):
a, b = map(int, input().split())
print(a - 1 if a > b else a)

Solution (Python):
a,b=map(int,input().split())
ct=0
for i in range(1,a+1):
    for j in range(1,32):
        if(a!=b):
            if(i==b):
                break
            elif(i==j):
                ct=ct+1
        elif(i==j):
            ct=ct+1
               
print(ct)

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

print(a if a <= b else a - 1)

Solution (Python):
a,b=map(int,input().split())
if a>b:
    print(a-1)
else:
    print(a)

Solution (Python):
a,b = map(int,input().split())
print(a-1 if b<a else a)

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

print(a if a<= b else a-1)

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

Solution (Python):
a, b = map(int, input().split())
print(a - 1) if a > b else print(a)

Solution (Python):
a, b = map(int, input().split())
if b < a:
    print(a-1)
else:
    print(a)

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop

import collections

a,b = map(int,input().split())
ans = a - 1
for i in range(b+1):
    if a == i:
        ans +=1
print(ans)

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

if b >= a:
    print(a)
else:
    print(a-1)

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

if a > b:
  print(a-1)
else:
  print(a)

Solution (Python):
a,b=map(int,input().split())
if a<=b:
    ans=a
else:
    ans=a-1
print(ans)

Solution (Python):
a,b=map(int,input().split())
if b>=a:
  print(a)
else:
  print(a-1)

Solution (Python):
a,b = map(int, input().split())
print(a if a<=b else a-1)

Solution (Python):
a,b=map(int,input().split())
if a<=b:
  print(a)
else:
  print(a-1)

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

if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):
a,b = map(int,input().split())
if a<=b:
    print(a)
else:
    print(a-1)

Solution (Python):
a, b = map(int, input().split())
if a <= b:
    print(a)
else:
    print(a - 1)

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
count = a
if a > b:
  count -= 1
print(count)

Solution (Python):
a,b=map(int,input().split())
if b < a:
  print(a-1)
else:
  print(a)

Solution (Python):
a, b = map(int, input().split())
if a <= b :
  print(a)
else:
  print(a-1)

Solution (Python):

url = "https://atcoder.jp//contests/abc096/tasks/abc096_a"

def main():
    m, d = list(map(int, input().split()))
    ans = m
    if m > d:
        ans -= 1
    print(ans)

if __name__ == '__main__':
    main()

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 accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a, b = MAP()
print(a if a <= b else a-1)

Solution (Python):
a,b=map(int,input().split())
if a>b:
    print(a-1)
else:
    print(a)

Solution (Python):
a, b = map(int, input().split())
print(a if a <= b else a - 1)

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

if b >= a: print(a)
else: print(a-1)

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    a,b=map(int,input().split())
    if a<=b:
        print(a)
    else:
        print(a-1)

if __name__ == '__main__':
    main()

Solution (Python):
a,b=map(int,input().split())
if(b<a):
  print(a-1)
else:
  print(a)

Solution (Python):
a, b = map(int, input().split())
if a > b:
  print(a-1)
else:
  print(a)

Solution (Python):
a,b=[int(i) for i in input().split()]
if b>=a:
  print(a)
else:
  print(a-1)

Solution (Python):
a,b=map(int,input().split())
if a<=b:
  print(a)
else:
  print(a-1)

Solution (Python):
a,b = map(int, input().split())
if a>b:
  print(a-1)
else:
  print(a)

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

if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):


def main():
    a, b = map(int, input().split())
    if b < a:
        print(a - 1)
    else:
        print(a)

if __name__ == "__main__":
    main()

Solution (Python):
a, b = map(int, input().split())
ans = a - 1
if b >= a:
    ans += 1
print(ans)

Solution (Python):
def resolve():
    a,b=map(int, input().split())
    if b<a:
        print(a-1)
    else:
        print(a)
resolve()

Solution (Python):
a, b = map(int, input().split())
if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):
a,b=map(int,input().split())
if b>=a:
    print(a)
else:
    print(a-1)

Solution (Python):
a,b = map(int,input().split())
if a <= b:
  print(a)
else:
  print(a-1)

Solution (Python):
a, b = input().split()
print(int(a)-(a>b))

Solution (Python):
a,b = map(int, input().split())
print(a if a<=b else a-1)

Solution (Python):
a, b = map(int, input().split())
if a<=b:
  print(a)
else:
  print(a-1)

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

else:
    print(a-1)

Solution (Python):
import datetime
def main():
    a, b = map(int, input().split())
    cnt = 0
    for i in range(1, 13):
        if datetime.date(2018, i, i) <= datetime.date(2018, a, b):
            cnt += 1
    print(cnt)
if __name__ == "__main__":
    main()

Solution (Python):
a,b=map(int,input().split())
if a<=b:
    print(a)
else:
    print(a-1)

Solution (Python):

import sys


def solve(a: int, b: int):
    print(a if a <= b else a - 1)


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


if __name__ == '__main__':
    main()

Solution (Python):
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

def main():
    a, b = nm()

    ans = a
    if b < a:
        ans -= 1

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
a, b = map(int, input().split())
if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):
a,b=map(int,input().split())
print(a if a<=b else a-1)

Solution (Python):
a,b = map(int,input().split())
if a <= b:
  print(a)
else:
  print(a-1)

Solution (Python):
a,b = map(int,(input().split()))
c = a-1
if b >= a:
    c += 1
print(c)

Solution (Python):
a, b = map(int, input().split())
if a > b :
  print(a-1)
else:
  print(a)

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

if a <= b:
  print(a)
else:
  print(a - 1)

Solution (Python):
a, b = map(int, input().split())
print(a if a <= b else a-1)

Solution (Python):
a,b=map(int, input().split())
if a<=b:
  print(a)
else:
  print(a-1)

Solution (Python):
a,b=map(int,input().split())
if a<=b:
    print(a)
else:
    print(a-1)

Solution (Python):
a, b = map(int, input().split())
if a > b:
    print(a-1)
else:
    print(a)

Solution (Python):
a, b = map(int,input().split())
ans = a
if a > b:
    ans -= 1
print(ans)

Solution (Python):
a, b = map(int,input().split())
ans = a
if a > b:
    ans -= 1
print(ans)

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

if n <= b:
  print(n)
  
else:
  print(n - 1)

Solution (Python):
a,b = list(map(int,input().split()))
if a > b:
    print(a-1)
else:
    print(a)

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

print(a-1 if a > b else a)

Solution (Python):
a, b = map(int, input().split())
ans = a - 1
if b >= a:
    ans += 1
print(ans)

Solution (Python):
a,b=map(int,input().split())
if a<=b:
    print(a)
else:
    print(a-1)

Solution (Python):
a, b = map(int,input().split())
if b >= a:
  print(a)
else:
  print(a-1)

Solution (Python):
a,b=map(int,input().split())
if a<=b:
  print(a)
else:
  print(a-1)

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

if a > b:
  print(a-1)
else:
  print(a)

Solution (Python):
a , b = map(int , input().split())
if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):
a, b = map(int, input().split())
print(a if a<=b else a-1)

Solution (Python):
a,b = map(int,input().split())
if a<=b:
    print(a)
elif a>b:
    print(a-1)

Solution (Python):
import sys
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))

def main():
    a, b = MII()
    cnt = a-1
    if b>=a: cnt+=1
    print(cnt)

if __name__ == '__main__':
    main()

Solution (Python):
icase=0    
if icase==0:
    a,b=map(int,input().split())
    if a<=b:
        print(a)
    else:
        print(a-1)

Solution (Python):
a,b=map(int,input().split())
if a>b:
  print(a-1)
else:
  print(a)

Solution (Python):
a,b = map(int,input().split())
if a <= b:
  print(a)
else:
  print(a-1)

Solution (Python):
m,d=map(int,input().split())
print(m if d >= m else m-1)

Solution (Python):
a,b=map(int,input().split())
print(a if a<=b else a-1)

Solution (Python):
a,b=map(int,input().split())
print(a if b>=a else a-1)

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

ans = a-1

if b >= a:
    ans += 1

print(ans)

Solution (Python):
a, b = map(int, input().split())
if a > b:
  print(a-1)
else:
  print(a)

Solution (Python):
a,b=map(int,input().split())
if a<=b:
  print(a)
else:
  print(a-1)

Solution (Python):
a,b = map(int,input().split())
print(a if a<=b else a-1)

Solution (Python):
a, b = map(int, input().split())
print(a-1 if a > b else a)

Solution (Python):
a, b = map(int, input().split())
if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):
def resolve():
    a, b = list(map(int, input().split(" ")))
    print(a if a <= b else a-1)

if '__main__' == __name__:
    resolve()

Solution (Python):
a,b=map(int, input().split())
print(a if a<=b else a-1)

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

if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):
a,b=map(int,input().split())
if a>b:
    print(a-1)
else:
    print(a)

Solution (Python):
a,b=map(int,input().split())
if a<=b:
  print(a)
else:
  print(a-1)

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

if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):
n,m = map(int, input().split())
if n<=m:
  print(n)
else:
  print(n-1)

Solution (Python):
a, b = map(int, input().split())
print(a if a <= b else a-1)

Solution (Python):
a, b = map(int, input().split())
if(a<=b):
    print(a)
else:
    print(a-1)

Solution (Python):
a, b = map(int, input().split())
ans = a if a <= b else a - 1
print(ans)

Solution (Python):
a,b = map(int,input().split())
print(a - (a > b))

Solution (Python):
a, b = map(int, input().split())
if b < a:
    print(a-1)
else:
    print(a)

Solution (Python):
a,b = map(int,input().split())
if a <= b:
  print(a)
else:
  print(a-1)

Solution (Python):
a, b = map(int, input().split())
if a <= b:
  print(a)
else:
  print(a-1)

Solution (Python):
from datetime import datetime as dt
a = dt.strptime(input(), "%m %d")
print(sum(d <= a for d in [dt(1900,i,i) for i in range(1, 13)]))

Solution (Python):
a,b=[int(i) for i in input().split()]
if a<=b:
    print(a)
else:
    print(a-1)

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

if b >= a:
    print(a)
else:
    print(a-1)

Solution (Python):
a,b = map(int,input().split())
print(a-1 +( 1 if a <= b else 0))

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

if B >= A:
    print(A)
else:
    print(A-1)

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

if a <= b:
  print(a)
else:
  print(a-1)

Solution (Python):
a,b = map(int,input().split())
if a <= b:
    print(a)
else:
    print(a-1)

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

if b >= a:
  print(a)
else:
  print(a - 1)

Solution (Python):
a,b = map(int,input().split())
if b >= a:
    print(a)
else:
    print(a-1)

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

if a <= b:
    print(a)
else:
    print(a - 1)

Solution (Python):
a,b=map(int,input().split())
print(a if a<=b else a-1)

Solution (Python):
a, b = map(int, input().split())
if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):
a,b=map(int,input().split())
if a>b:
    print(a-1)
else:
    print(a)

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

if a>b:
  print(a-1)
else:
  print(a)

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

if a<=b:
  print(a)
else:
  print(a-1)

Solution (Python):
a, b = map(int, input().split())
print(a-1+(a<=b))

Solution (Python):
a, b = map(int, input().split())
if a <= b:
  print(a)
else:
  print(a-1)

Solution (Python):
a, b = map(int, input().split())
if b < a:
    print(a - 1)
else:
    print(a)

Solution (Python):
def main():
    a, b = map(int, input().split())
    print(a-(a>b))
    
if __name__ == "__main__":
    main()

Solution (Python):
a, b = map(int, input().split())
print(a) if a <= b else print(a-1)

Solution (Python):
a,b = map(int,input().split())
if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):
a, b = map(int, input().split())
if a <= b:
    print(a)
else:
    print(a-1)

Solution (Python):
a, b = map(int, input().split())
if a <= b:
    print(a)
else:
    print(a-1)

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

if b >= a:
    print(a)
else:
    print(a - 1)

Solution (Python):
a,b=map(int,input().split())
if a<=b:print(a)
else: print(a-1)

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

if a <= b:
    print(a)
else:
    print(a-1)