output_description: Print the number of days from 2018-1-1 through 2018-a-b that are Takahashi.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      a b
attempt: M, D = map(int, input().split())
  print(min(M, D))
  
problem_description: 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?
samples: [{"input": "5 5", "output": "5\n    \n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\n* * *"}, {"input": "2 1", "output": "1\n    \n\nThere is only one day that is Takahashi: 1-1.\n\n* * *"}, {"input": "11 30", "output": "11\n    \n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7,\n8-8, 9-9, 10-10 and 11-11."}]