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.



Sample input:
5 5


Sample output:
5

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
if(a[1] < a[0]):
	print (a[0]-1)
else:
	print (a[0])

Submission status: Accepted

Solution code:
# A - Day of Takahashi

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INPUT = list(map(int,input().split()))
a=INPUT[0]
b=INPUT[1]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = (int(x) for x in input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if a <= b:
    print(a)

else:
    print(a - 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
m,d=map(int,input().split());print(m-(m>d))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    a, b = list(map(int, input().rstrip('\n').split()))
    print(a if b >= a else a - 1)


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y=map(int,input().split())

a=x-1

if x<=y:
  a+=1

print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = [int(x) for x in input().split()]
if B>=A:
  print(A)
else:
  print(A-1)

Submission status: Accepted

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

aa096()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
month, day = map(int, input().split())

if month <= day:
    print(month)
else:
    print(month - 1)

Submission status: Accepted

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

Submission status: Accepted

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

ans = A - 1

if B >= A:
    ans += 1

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
x=list(map(int,input().split()))
if x[0]>x[1]:
    print(x[0]-1)
else:
    print(x[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:



def main():


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

    if M < N:
        print(N-1)
    else:
        print(N)









if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
a,b=map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(int, input().strip().split(' '))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = (int(i) for i in input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
count_takahashi = 0
for month in range(1, a + 1):
    if month != a:
        count_takahashi += 1
    else:
        if b >= month:
            count_takahashi += 1

print(count_takahashi)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
	line = input()
	vector = [int(x) for x in line.split()]
	a = vector[0]
	b = vector[1]
	if a <= b:
		print(a)
	else:
		print(a - 1)
 
 
 
if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# ABC096 A - Day of Takahashi
a,b = map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = a - 1

if (b >= a):
  ans += 1

print(ans)

Submission status: Accepted

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

print(A - (A>B))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
 
#a>bならa月の高橋は来ない
if a > b:
  print(a-1)
else:
  print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))
count = 0
m = [i for i in range(1, a)]
for month in m:
    count += 1
if b >= a:
    count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from datetime import date, timedelta

a, b = map(int, input().split())
d1 = date(year=2018, month=1, day=1)
d2 = date(year=2018, month=a, day=b)

count = 0
while d1 <= d2:
    if d1.month == d1.day:
        count += 1
    d1 += timedelta(days=1)

print(count)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print((a-1,a)[a<=b])

Submission status: Accepted

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

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

Submission status: Accepted

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


if a == 12:
  if b >= 12:
    print(12)
elif a == 11:
  if b >= 11:
    print(11)
  else:
    print(10)
elif a == 10:
  if b >= 10:
    print(10)
  else:
    print(9)
elif a == 9:
  if b >= 9:
    print(9)
  else:
    print(8)
elif a == 8:
  if b >= 8:
    print(8)
  else:
    print(7)

elif a == 7:
  if b >= 7:
    print(7)
  else:
    print(6)

elif a == 6:
  if b >= 6:
    print(6)
  else:
    print(5)

elif a == 5:
  if b >= 5:
    print(5)
  else:
    print(4)

elif a == 4:
  if b >= 4:
    print(4)
  else:
    print(3)

elif a == 3:
  if b >= 3:
    print(3)
  else:
    print(2)

elif a == 2:
  if b >= 2:
    print(2)
  else:
    print(1)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

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

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())

## 数値
 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

a, b =  map(int, sys.stdin.readline().split())

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

Submission status: Accepted

Solution code:
(a, b) = (int(tok) for tok in input().split())
res = a - 1
  
if b >= a:
	res += 1

print(res)

Submission status: Accepted

Solution code:
a = [int(_) for _ in input().split()]
if len(a) == 2:
    if (a[0] == 1 and 1 <= a[1] <= 31) or (a[0] == 2 and a[1] ==1):
        print(1)
    elif (a[0] == 2 and 2 <= a[1] <= 28) or (a[0] == 3 and 1 <= a[1] <= 2):
        print(2)
    elif (a[0] == 3 and 3 <= a[1] <= 31) or (a[0] == 4 and 1 <= a[1] <= 3):
        print(3)
    elif (a[0] == 4 and 4 <= a[1] <= 30) or (a[0] == 5 and 1 <= a[1] <= 4):
        print(4)
    elif (a[0] == 5 and 5 <= a[1] <= 31) or (a[0] == 6 and 1 <= a[1] <= 5):
        print(5)
    elif (a[0] == 6 and 6 <= a[1] <= 30) or (a[0] == 7 and 1 <= a[1] <= 6):
        print(6)
    elif (a[0] == 7 and 7 <= a[1] <= 31) or (a[0] == 8 and 1 <= a[1] <= 7):
        print(7)
    elif (a[0] == 8 and 8 <= a[1] <= 31) or (a[0] == 9 and 1 <= a[1] <= 8):
        print(8)
    elif (a[0] == 9 and 9 <= a[1] <= 30) or (a[0] == 10 and 1 <= a[1] <= 9):
        print(9)
    elif (a[0] == 10 and 10 <= a[1] <= 31) or (a[0] == 11 and 1 <= a[1] <= 10):
        print(10)
    elif (a[0] == 11 and 11 <= a[1] <= 30) or (a[0] == 12 and 1 <= a[1] <= 11):
        print(11)
    elif (a[0] == 12 and 12 <= a[1] <= 31):
        print(12)
    else:
        print('hoge!')
else:
    print('hoge!')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
cnt = 0
cnt += (a - 1)
if b >= a:
    cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
num = input().split()

if int(num[1]) >= int(num[0]):
  print(num[0])
else:
  print(int(num[0])-1)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
a,b=map(int,input().split())

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main(a, b):
    if b < a:
        return a-1
    else:
        return a


if __name__ == '__main__':
    a, b = map(int, input().split(' '))
    print(main(a, b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    a, b = map(int, input().split())
    date = 100 * a + b
    cand = [100 * i + i for i in range(1, 13)]
    print(len([c for c in cand if c <= date]))


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print(str(a-(b<a)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print([a-1, a][a <= b])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
a,b = 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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = [int(x) for x in input().split()]
print(a-1+(b>=a))

Submission status: Accepted

Solution code:
month, day = [int(i) for i in input().split()]
if month > day:
    print(month - 1)
else:
    print(month)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    test()

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
print(a-1+max(min(b//a,1),0))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
var = input()
var = var.split(' ')
a = var[0]
b = var[1]
ans = int(a)
if (a > b):
    ans-=1
print(ans)

Submission status: Accepted

Solution code:
m,d=map(int,input().split()); print([m,m-1][d<m])

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(a-1+(a<=b)*1)

Submission status: Accepted

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

Submission status: Accepted

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

count = a[0]-1
if a[1]>=a[0]:
  count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#14:23
a,b = map(int,input().split())
if b >= a:
  print(a)
else:
  print(a-1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#96

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = list(map(int,input().split()))
#print(a,b)
ans =0
if a == b or a<b :
  print(a)
else:
  print(a-1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
if a[1]>=a[0]:
    print(a[0])
else:
    print(a[0]-1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:


endday = [31] * 13
endday[2] = 28
for i in [4,6,9,11]:
    endday[i] = 30

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

res = 0
done = False
for m in range(1, 13):
    if done:
        break
    for d in range(1, endday[m] + 1):
        if m == d:
            res += 1
        if m == a and d == b:
            done = True
            break

print(res)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
day = 0
for a in range(1, A):
  day += 1
if A <= B:
  day += 1
print(day)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
from collections import deque
from functools import reduce
from operator import mul
from pprint import pprint
import bisect
import copy
import fractions
import itertools
import math
import queue
import random
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) 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 MI(): return map(int, sys.stdin.readline().split())
def II(): return int(sys.stdin.readline())
def IS(): return input()
def C(x): return Counter(x)
def GCD_LIST(numbers): return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): return reduce(LCM, numbers)
def LCM(m, n): return (m * n // fractions.gcd(m, n))
def COMBINATION(n, r):
    if n < 0 or r < 0 or n < r:
        return 0
    r = min(n-r, r)
    if r == 0:
        return 1
    o = reduce(mul, range(n, n - r, -1))
    u = reduce(mul, range(1, r + 1))
    return o // u
class UnionFind():

    def __init__(self, n):
        self.n = n
        self.node = [i for i in range(n)]
        self.size = [1 for _ in range(n)]

    def same(self, x, y):
        return bool(self.root(x) == self.root(y))

    def root(self, x):
        if self.node[x] == x:
            return x
        else:
            self.node[x] = self.root(self.node[x])  # 経路圧縮
            return self.node[x]

    def unite(self, x, y):
        x, y = self.root(x), self.root(y)
        if x == y:
            return  # 結合不要
        if self.size[x] < self.size[y]:
            x, y = y, x
        self.node[y] = x
        self.size[x] += self.size[y]

    def return_size(self, x):
        return self.size[self.root(x)]


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a,b = [int(i) for i in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007

#A
def A():
    a, b = LI()
    if a <= b:
        print(a)
    else:
        print(a-1)
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    n = II()
    ans = []
    sosu = [2]
    i = 2
    while len(ans) != n:
        for k in sosu:
            if i % k == 0:
                i += 1
                break
        else:
            sosu.append(i)
            if i % 5 == 1:
                ans.append(i)
            i += 1
    for i in ans:
        print(i, end=" ")
    print()
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

# print(a)
# print(b)

result = a - 1

if a <= b:
    result += 1

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
#ls = list(map(int,input().split()))
#r = int(input())
#s = input()

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

Submission status: Accepted

Solution code:
import sys

def input():
    return sys.stdin.readline().rstrip()

if __name__ == "__main__":
    a, b = map(int, input().split())

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

    print(month_diff)

Submission status: Accepted

Solution code:
a,b = (int(_) for _ in input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
if a[0]<=a[1]:
  print(a[0])
else:
  print(a[0]-1)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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