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())
print(a if a<=b or a==1 else a-1)

Solution (Python):
def mapt(fn, *args):
    return tuple(map(fn, *args))


def Input():
    return mapt(int, input().split(" "))


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

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


main()

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

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

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

print(a - int(a > b))

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

ans=a-1

if b>=a:
	print(ans+1)
else:
  	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:
  print(a-1)
else:
  print(a)

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

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

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

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

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

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())
ans=0
for i in range(1,a):
   for j in range(1,13):
      if i==j:
         ans+=1
for i in range(a,a+1):
   for j in range(1,b+1):
      if i==j:
         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 a <= b:
  print(a)
else:
  print(a-1)

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

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

Solution (Python):
a,b=list(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:
    print(a)
else:
    print(a-1)

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

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

ans = a if b >= a else a - 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 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 1 <= b < a:
  print(a-1)
elif a <= b:
  print(a)

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

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

cnt = a - (1 if a > b else 0)

print(cnt)

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):
month, day = map(int, input().split())
takahashi_days = month
if day >= month:
    print(takahashi_days)
elif month > day:
    print(takahashi_days -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 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())
if a > b:
    print(a-1)
else:
    print(a)

Solution (Python):
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 a> b:
  print(a-1)
else:
  print(a)

Solution (Python):
a , b = map(int,input().split())
cou = 0
for i in range(1,13):
    if a > i:
        cou += 1
    elif a == i and b >= i:
        cou += 1
    else:
        break
print(cou)

Solution (Python):
import sys

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


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

    ans = a - 1

    if a <= b:
        ans += 1

    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
def resolve():
    a, b = map(int, input().split())
    if a <= b: c = a
    else: c = a - 1
    print(c)
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 a <= b:
    print(a)
else:
    print(a - 1)

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

ans = a - (a>b)
print(ans)

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())
cnt = 0
cnt += a
if b < a:
    cnt -= 1
print(cnt)

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

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

Solution (Python):
a,b = map(int,input().rstrip().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())
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-(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())
ans= a if a<=b else a-1
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:
  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())
res = a - 1
if a <= b:
    res += 1

print(res)

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

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

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

Solution (Python):
a, b = list(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())
takahashi = a - 1
if b >= a:
    takahashi += 1
print(takahashi)

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)
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):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    a, b = LI()

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

if __name__ == '__main__':
    resolve()

Solution (Python):


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

ans = 0
for i in range(1, 13):
    if i < a:
        ans += 1
    elif i == a:
        if i <= 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())
if a<=b:
    ans=a
else:
    ans=a-1
print(ans)

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())
print(a if b>=a 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 b >= a else 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())
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())
c = a
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())
if a<=b :
  print(a)
else :
  print(a-1)

Solution (Python):
LI = lambda: list(map(int, input().split()))

a, b = LI()


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


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())
print(a-(b<a))

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

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())
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 a <= b:
    print(a)
else:
    print(a - 1)

Solution (Python):
from sys import stdin, stdout


def main():
    line = stdin.readline()
    parts = line.split()
    a = int(parts[0])
    b = int(parts[1])

    if a <= b:
        stdout.write(str(a))
    else:
        stdout.write(str(a - 1))


main()

Solution (Python):
from sys import stdin,stdout

def main():
    line=stdin.readline()
    parts=line.split()
    a=int(parts[0])
    b = int(parts[1])
    if b>=a:
        stdout.write(str(a))
    else:
        stdout.write(str(a-1))
main()

Solution (Python):
from sys import stdin, stdout

def main():
    line = stdin.readline()
    parts = line.split()
    mes = int(parts[0])
    dia = int(parts[1])

    stdout.write(str(mes if dia>=mes else mes-1))

main()

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

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

    ans = 0
    for i in range(1, 13):
        if i < a:
            ans += 1
        elif i == a and i <= b:
            ans += 1

    print(ans)
    return


if __name__ == '__main__':
    main()

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 a <= b:
        print(a)
    else:
        print(a - 1)


if __name__ == "__main__":
    main()

Solution (Python):
a,b=map(int,input().split());print([max(1,a-1),a][b>=5])

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

Solution (Python):
import sys

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


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


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())
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())
print(a if a<=b else a-1)

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

if a>b:
    print(a-1)
elif a <= b:
    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())
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 = map(int, input().split())

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

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

Solution (Python):
tmp = input().split(" ")
month = int(tmp[0])
day = int(tmp[1])

print(month) if day >= month else print(month - 1)

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

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

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

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

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

Solution (Python):
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

a,b = I()
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):
month, day = map(int, input().split())

if (day >= month):
    cnt = month
else:
    cnt = month - 1


print(cnt)

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 b < a else a)

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

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

print(a - int(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())

ans =  a - 1

if a <= b:
    ans += 1
            
print(ans)

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 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 =0
for A in range(1,a+1,1):
    for B in range(1,13,1):
        if A==B:
            if a > A or (a==A and b>=B):
                ans+=1
print(ans)

Solution (Python):

[a,b] = list(map(int,input().split()))

if a<=b:
    print(a)
elif a>b:
    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 b < a:
    ans -= 1

print(ans)

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

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

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

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

Solution (Python):
a,b = map(int, input().split()) 
print(min(min(a,12)-1,min(max(b,a-1),31)-1)+1)

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

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

print(a - (a > b))

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())
ans = 0

for i in range(1, 13):
	if i < a:
		ans += 1
	elif i == a and i <= b:
		ans += 1

print(ans)

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a, b = map(int, readline().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):
a, b = map(int, input().split())
print(a if a <= b else a - 1)

Solution (Python):
a,b = (int(X) for X in input().split())
if b>=a: 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)
main()

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


if __name__ == "__main__":
    solve()

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

Solution (Python):
import sys, os, math, bisect, itertools, collections, heapq, queue

from decimal import Decimal
from collections import defaultdict, deque

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

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


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    a, b = il()
    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)
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())
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):
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 A > B:
    print(A-1)
else:
    print(A)

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

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

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

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

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

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

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

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

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

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

for i in range(1, 13):
    if (i > a) or ((i == a) and (i > b)):
        break
    ans = i
print(ans)

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

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

if not ( 1 <= a <= 12 and 1 <= b <= 31 ):
    sys.exit()

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

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

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

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

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

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


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

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

Solution (Python):
a, b = map(int, input().split())
if b < a:
	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:
  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):
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:
    a += 1

print(a-1)

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

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

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

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

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

Solution (Python):

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



ans = a-1
if b>=a:
	print(ans+1)
else:
	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 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:
    sengetu = a- 1
    sengetu += 1

else:
    sengetu = a - 1
    
print(sengetu)

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 - 1)
else:
  print(a)

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

a,b = I()
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())

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


ans=a-1
for day in range(1,b+1):
    if a==day :
        ans+=1
print(ans)

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

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

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())
if a > b:
    print(a-1)
else:
    print(a)

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

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+int(d>=m)-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 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())
additional = -1
if b >= a:
    additional += 1
print(a + additional)

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

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

a, b = lr()
answer = a - 1
if b >= a:
    answer += 1
print(answer)

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

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)
else:
    print(a-1)

Solution (Python):
a, b = map(int, input().split())
ans = 0
ans += a
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):
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, re
from math import ceil, floor, sqrt, pi, factorial
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_list(N): return [s_list() for _ in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7

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

    if a > b:
        a-= 1

    print(a)

if __name__ == '__main__':
    main()

Solution (Python):
def actual(a, b):
    if a <= b:
        return a

    return a - 1

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

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

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

if __name__ == '__main__':
    main()