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 Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        int h, w;
        char s = '#';
        char d = '.';
        char matrix[][];
        int count = 0;
        String str = "Yes";
        String temp;

        Scanner sc = new Scanner(System.in);
        h = sc.nextInt();
        w = sc.nextInt();

        matrix = new char[h][w];

        for (int i = 0; i < h; i++) {
            temp = sc.next();
            matrix[i] = temp.toCharArray();
        }
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                if (i == 0) {
                    if (j == 0) {
                        if (matrix[i][j] == '#') {
                            if (matrix[i+1][j] == '.' && matrix[i][j+1] == '.') {
                                str = "No";
                            }
                        }
                    }
                    else if (j != w - 1){
                        if (matrix[i][j] == '#') {
                            if (matrix[i+1][j] == '.' && matrix[i][j+1] == '.' && matrix[i][j-1] == '.') {
                                str = "No";
                            }
                        }
                    } else {
                        if (matrix[i][j] == '#') {
                            if (matrix[i+1][j] == '.' && matrix[i][j-1] == '.') {
                                str = "No";
                            }
                        }
                    }
                } 
                else if (i != h - 1) {
                    if (j == 0) {
                        if (matrix[i][j] == '#') {
                            if (matrix[i+1][j] == '.' && matrix[i][j+1] == '.' && matrix[i-1][j] == '.') {
                                str = "No";
                            }
                        }
                    }
                    else if (j != w - 1){
                        if (matrix[i][j] == '#') {
                            if (matrix[i+1][j] == '.' && matrix[i][j+1] == '.' && matrix[i][j-1] == '.' && matrix[i-1][j] == '.') {
                                str = "No";
                            }
                        }
                    } else {
                        if (matrix[i][j] == '#') {
                            if (matrix[i+1][j] == '.' && matrix[i][j-1] == '.' && matrix[i-1][j] == '.') {
                                str = "No";
                            }
                        }
                    }
                }
                else {
                    if (j == 0) {
                        if (matrix[i][j] == '#') {
                            if (matrix[i][j+1] == '.' && matrix[i-1][j] == '.') {
                                str = "No";
                            }
                        }
                    }
                    else if (j != w - 1){
                        if (matrix[i][j] == '#') {
                            if (matrix[i][j+1] == '.' && matrix[i][j-1] == '.' && matrix[i-1][j] == '.') {
                                str = "No";
                            }
                        }
                    } else {
                        if (matrix[i][j] == '#') {
                            if (matrix[i][j-1] == '.' && matrix[i-1][j] == '.') {
                                str = "No";
                            }
                        }
                    }
                }
            }
        }
        System.out.println(str);
    }
}