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

Submission status: Accepted

Solution code:
# A
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 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)
elif a > b :
    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:
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    A,B = map(int, lines.pop(0).split(' '))
    if A <= B:
        print(A)
    else:
        print(A-1)
#
# main
#
lines = [x.strip() for x in sys.stdin.readlines()]
#
 # solve !!
#
solve(lines)

Submission status: Accepted

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

count = 0
count += a-1
if b >= a:
    count +=1

print(count)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b = [int(n) for n in 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)
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:
"""AtCoder"""

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print((a-1)+(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())
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:
#!/usr/bin/env python3

def main():
    na = list(map(int, input().split()))
    a, b = na[0], na[1]

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

Submission status: Accepted

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

Submission status: Accepted

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

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(x) for x in input().split()]

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

print(ans)

Submission status: Accepted

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

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 = 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());print([a-1,a][b>=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())

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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())
cnt = a - 1
if b >= a:
    cnt += 1
print(cnt)

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 = 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:
# Day of Takahashi
print((lambda x: x[0] if x[0] <= x[1] else x[0]-1)(tuple(map(int, input().split()))))

Submission status: Accepted

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

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

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=(int(i) for i in 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)   
else:
  print(a-1)

Submission status: Accepted

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

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

Submission status: Accepted

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

result = A - (A > B)

print(result)

Submission status: Accepted

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

if __name__ == "__main__":
    main()

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=input().strip().split(" ")
b=[int(i) for i in a]

c=b[0]-1

if(b[1]>=b[0]):
    print(c+1)
else:
    print(c)

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


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

Submission status: Accepted

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

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 = [int(i) for i in input().split()]
print(a) if b>=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:
#横にn個入力
a, b = map(int, input().split())
count = 0
for i in range(1,a + 1):
    if i < a:
        for j in range(1,31):
            if i == j:
                count += 1
    if i == a:
        for j in range(1,b + 1):
            if i == j:
                count += 1

print(count)

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:
def run(a, b):
    if a <= b:
        return a
    else:
        return a - 1

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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(i) for i in input().split(' '))
print(a if a<=b else a-1)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = [int(_) for _ in 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-1)
else:
  print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
month, day = map(int, input().split())
dayOfTakahashi = month if month<=day else month -1
print(dayOfTakahashi)

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:
#!/usr/bin/env python3
# -*- 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 = [int(m) for m in input().split(" ")]

print(a-1 + bool(b//a))

Submission status: Accepted

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

ans = a if b >= a else a-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:
#coding: utf-8
m, d = map(int, input().split())
print([m-1, m][d >= m])

Submission status: Accepted

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

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(i) for i in input().split()]

ans = a

if a > b:
    ans -= 1

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin

a, b = [int(i) for i in stdin.readline().rstrip().split()]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
 # -*- coding: utf-8 -*-

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

if __name__ == '__main__':
    main()

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, raw_input().split())
ans = a
if b < a: ans = ans - 1
print ans

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 = (int(_) for _ in input().split())
print(a-1) if a > b else print(a)

Submission status: Accepted

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

Submission status: Accepted

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

print(a - (a > b))

Submission status: Accepted

Solution code:
#96a
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)
else :
  print(a-1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]


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


def main():
    a, b = map(int, input().split())
    ans = 0
    for m in range(1, a + 1):
        for d in range(1, b + 1 if m == a else 32):
            ans += (m == d)
    print(ans)

if __name__ == '__main__':
    main()

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

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

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)

# Debug output
def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

# Binary converter
def to_bin(x):
    return bin(x)[2:]

# --------------------------------------------

dp = None

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

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = [int(m) for m in input().split(" ")]

print(a-1 + bool(b//a))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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 = (int(x) for x in raw_input().split())
if a > b:
	print a-1
else:
	print 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:
#-*-coding:utf-8-*-

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

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

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = list(map(int,input().split()))
count = 0
for i in range(1,a+1):
    for j in range(30):
        if i == j:
            count = count +  1
if (b < a):
    count = count -1
print(count)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
sol = 0
for i in range(1, a+1):
    if i == a:
        if b >= a:
            sol += 1
    else:
        sol += 1
print(sol)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(c)

Submission status: Accepted

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

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

print(ans)

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

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:
goop=input().split()
if int(goop[0])<=int(goop[1]):
    print(int(goop[0]))
else:
    print(int(goop[0])-1)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
# 1 <= a <=12, and all months have at least 12 days
count=0
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 a <= b else 0))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = input().split()
a = int(A)
b = int(B)
count = 0

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if b-a>=0:
	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:
day = list(map(int,input().split(" ")))

takahashi = day[0]

if takahashi > day[1]:
	takahashi -= 1

print(takahashi)

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
 
cnt = 0
for i in range(1, 13):
    if i > x:
        break
    for j in range(1, 13):
        if i == j:
            cnt += 1
        if i == x and j == y:
            break
print(cnt)

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

if x <= y:
  print(x)
else:
  print(x-1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#coding : utf8


"""
@param {int}
@return {int}
"""
def calcTakahashi(a,b):

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

    # takahashi_count = 0
    # for i in range(1,a+1):
    #     for j in range(1,b+1):
    #         if( i == j ):
    #                 takahashi_count += 1
    #
    # return takahashi_count

if __name__ == '__main__':

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

    print(calcTakahashi(a,b))

Submission status: Accepted

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

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:
l = list(map(int, input().split()))
a, b = [i for i in l]

ans_count = 0
for mon in range(1, a + 1):
    max_day = 31
    if mon == a:
        max_day = b

    for day in range(1, max_day + 1):
        if day == mon:
            ans_count += 1

print(ans_count)

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

Submission status: Accepted

Solution code:
x = [int(i) for i in input().split(" ")]
if x[0] <= x[1] :
    print(x[0])
else:
    print(x[0]-1)

Submission status: Accepted

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

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:
# input
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())
t=a*100+b
for x in range(12,0,-1):
    if t >= x*101:print(x);break

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:
    a -= 1

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:
month, day = [int(i) for i in input().split()]
dayOfTakahashi = month if month <= day else month - 1
print(dayOfTakahashi)

Submission status: Accepted

Solution code:
l = map(int, raw_input().split())

a = l[0]
b = l[1]

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

Submission status: Accepted

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

if month <= day :
    ans = month
else :
    ans = month - 1

print( ans )

Submission status: Accepted

Solution code:
# ANSHUL GAUTAM
# IIIT-D

a,b = map(int, input().split())
z = a-1
takahsashi = z+1
if(a>b):
	takahsashi = z
print(takahsashi)

Submission status: Accepted

Solution code:
X = input().split(" ")

a = int(X[0])
b = int(X[1])

if a < 1 and 12 < a:
    exit()
elif b < 1 and 31 < b:
    exit()

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

Submission status: Accepted

Solution code:
import sys

def readQuestion():
    line = sys.stdin.readline()
    sline = line.rstrip()
    [sa,sb] = sline.split()
    a = int(sa)
    b = int(sb)
    return(a,b)

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

def main():
    a,b = readQuestion()
    answer = solve(a,b)
    print(answer)
    
    # mainを呼び出す
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

print(takahashi)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
x,y = map(int,input().split())
if x <= y:
    s = x
else:
    s = x-1

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input().strip().split(" ")
x = list(map(int, x))

if x[0] <= x[1]:
    print(x[0])
else:
    print(x[0]-1)

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

if a[0] > a[1]:
  print(a[0]-1)
else:
  print(a[0])

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 = [int(i) for i in input().split()]
day = 0

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

print(day)