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

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

takahashi = 0

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

print(takahashi)

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:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

a, b = nl()

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

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())
print(a if b >= a else 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(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:
from sys import stdin
a,b = [int(x) for x in stdin.readline().rstrip().split()]
if a == b:
    print(a)
elif a > b:
    print(a-1)
elif b > a:
    print(a)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b = [int(ab) for ab 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:
def abc():
    a, b = map(int, input().rstrip().split())
    if a <= b:
        print(a)
    else:
        print(a - 1)


abc()

Submission status: Accepted

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

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

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

print(ans)

Submission status: Accepted

Solution code:
a, b = [int(x) for x in input().split()]
print(a-1) if a>b 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())
cnt = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = a - 1

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
#N = int(input())
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())
print(a+(-1 if a>b else 0))

Submission status: Accepted

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

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:
#!/usr/bin/env python3
import sys


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

    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  # type: int
    b = int(next(tokens))  # type: int
    solve(a, b)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b = map(int, raw_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 if a<=b else 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 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 b>=a else a-1)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
ans = 0
for i in range(1,13):
    if i < a:
        ans+=1
    elif i == a and a <= b:
        ans+=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:
m,d = map(int,input().split(" "))
print(m if d >= m else m-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
import sys


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


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

if __name__ == '__main__':
    main()

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

Submission status: Accepted

Solution code:
###############################################################################

from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    if y > x // 2:
        y = x - y

    ret = 1

    for i in range(0, y):
        j = x - i
        i = i + 1

        ret = ret * j
        ret = ret // i

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance


class UnionFind:

    def __init__(self, n):
        self.parent = [i for i in range(n)]

    def root(self, i):
        if (self.parent[i] == i):
            return i
        self.parent[i] = self.root(self.parent[i])
        return self.parent[i]

    def unite(self, i, j):
        rooti = self.root(i)
        rootj = self.root(j)
        if rooti == rootj:
            return
        if i < j:
            self.parent[rootj] = rooti
        else:
            self.parent[rooti] = rootj

    def same(self, i, j):
        return self.root(i) == self.root(j)


###############################################################################


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

    ans = 0

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

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

l = list(map(int, input().split()))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os

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

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


solve()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys


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

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
from collections.abc import Iterable
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
    from math import gcd
except Exception:
    from fractions import gcd


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

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  # type: int
    b = int(next(tokens))  # type: int
    result = solve(a, b)
    if isinstance(result, Iterable):
        result = '\n'.join([str(v) for v in result])
    print(result)

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
ab = a*100+b
ans = 0

for i in range(1, 13):
    if ab < 100*i+i:
        break
    ans += 1
print(ans)

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:
import datetime
a, b = map(int, input().split())
d = datetime.datetime(2018, 1, 1)
count = 0
while d <= datetime.datetime(2018, a, b):
	if (d.strftime('%m') == d.strftime('%d')):
		count+=1
	d = d + datetime.timedelta(days=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:
a,b = list(map(int,input().split()))
if b < a:
    print(a-1)
else:
    print(a)

Submission status: Accepted

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

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

Submission status: Accepted

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

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


def submit():
    a, b = read_input()

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

if __name__ == '__main__':
    submit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import numpy as np
import math
import re

n = input()
n = re.split(" ",n)
a = int(n[0])
b = int(n[1])
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:
a, b = map(int, input().split())
print(a) if b >= a else print(a-1)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if b >= 5:
  print(a)
elif a == 1 and b == 1:
  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:
a, b = (int(_) for _ 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 = 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 a>b:
	print(a-1)
else:
	print(a)

Submission status: Accepted

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

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

    print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
def main():
	a, b = 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- (a > b))

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper



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

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

Submission status: Accepted

Solution code:
# ABC096A - Day of Takahashi
a, b = list(map(int, input().rstrip().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())
if a <= b:
	print(a)
else:
	print(a - 1)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


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


def main():

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

ans = a

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

Submission status: Accepted

Solution code:
#!/usr/bin/python

def main():
    a, b = [int(x) for x in input().split()]
    print(a) if b >= a else print(a-1)



if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#096
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 b >= a:
    print a
else:
    print a - 1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = [int(i) for i in input().split()]
print(l[0] if l[0] <= l[1] else l[0] - 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 - (B < A))

Submission status: Accepted

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

Submission status: Accepted

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

print (ans)

Submission status: Accepted

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

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:
    a -= 1
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 = [int(item) for item in input().split()]

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

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

Submission status: Accepted

Solution code:
a,b = [int(x) for x in input().split()]
if(a>b):
  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:
years_month, years_day = [int(a) for a in input().split()]

if years_month > years_day:
    print(years_month - 1)

else:
    print(years_month)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = [int(_) for _ in input().split()]
print("{}".format(a - (b < a)))

Submission status: Accepted

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


if __name__ == '__main__':
    print(solve(input()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# /user/bin/python
# -*- coding: utf-8 -*-
import sys


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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def day_of_takahashi(a: int, b: int) -> int:
    return (a - 1) + (1 if a <= b else 0)


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

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
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)
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:
def main() -> None:
    a, b = map(int, input().split())
    ans = 0
    for i in range(1, 13):
        if a > i:
            ans += 1
        elif a >= i and b >= i:
            ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

def main():
	m, d = map(int, input().split(" "))
	
	if d >= m:
		print(m)
	else:
		print(m-1)
		
if __name__ == "__main__":
	main()

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

Submission status: Accepted

Solution code:
def main():
    a, b = 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())
res = a - 1
if a <= b:
    res += 1
print(res)

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc096/tasks/abc096_a
a, b = [int(x) for x in 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:
    ans = a
else:
    ans = a - 1

print(ans)
print()

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

Submission status: Accepted

Solution code:
import sys

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


if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
from sys import stdin
a, b = [int(x) for x 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) if(a<=b) else print(a-1)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

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

if int_a <= int_b:
    print(int_a)
else:
    print(int_a - 1)