Problem:
Score: 100 points

Problem Statement

In AtCoder Kingdom, Gregorian calendar is used, and dates are written in the "year-month-day" order, or the "month-day" order without the year.

For example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.

In this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.

How many days from 2018-1-1 through 2018-a-b are Takahashi?

Constraints

a is an integer between 1 and 12 (inclusive).

b is an integer between 1 and 31 (inclusive).

2018-a-b is a valid date in Gregorian calendar.

Input

Input is given from Standard Input in the following format:

a b

Output

Print the number of days from 2018-1-1 through 2018-a-b that are Takahashi.

Sample Input 1

5 5

Sample Output 1

5

There are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.

Sample Input 2

2 1

Sample Output 2

1

There is only one day that is Takahashi: 1-1.

Sample Input 3

11 30

Sample Output 3

11

There are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.

Solution in JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

"use strict"

const main = arg => {
  arg = arg.trim().split("\n");
  const H = parseInt(arg[0].split(" ")[0]);
  const W = parseInt(arg[0].split(" ")[1]);
  
  const tiles = arg.slice(1, H + 1).map(n=>n.split(""));
  
  const dx = [1, 0, -1, 0];
  const dy = [0, 1, 0, -1];
  
  for(let i in tiles) {
      for(let j in tiles[i]) {
          let cnt = 0;
          
          for(let k=0; k<4; k++) {
              let nx = dx[k] + parseInt(j);
              let ny = dy[k] + parseInt(i);
              
              if(ny < 0 || ny > H - 1) continue;
              if(nx < 0 || nx > W - 1) continue;
             
              if(tiles[ny][nx] === ".") {
                  cnt++;
              }
          }
          
          if(tiles[i][j] === "#" && cnt === 4) {
              console.log("No");
              return;
          }
      }
   }
   
   console.log("Yes");
}

main(require("fs").readFileSync("/dev/stdin", "utf8"));