Problem: A mouse encountered a nice big cake and decided to take a walk across it, eating the berries on top of the cake on its way. The cake is rectangular, neatly divided into squares; some of the squares have a berry in them, and some don't.

The mouse is in a bit of a hurry, though, so once she enters the cake from its northwest corner (the top left cell in the input data), she will only go east (right) or south (down), until she reaches the southeast corner (the bottom right cell). She will eat every berry in the squares she passes through, but not in the other squares.

The mouse tries to choose her path so as to maximize the number of berries consumed. However, her haste and hunger might be clouding her judgement, leading her to suboptimal decisions...

Input

The first line of input contains two integers H and W (1 ≤ H, W ≤ 5), separated by a space, — the height and the width of the cake.

The next H lines contain a string of W characters each, representing the squares of the cake in that row: '.' represents an empty square, and '*' represents a square with a berry.

Output

Output the number of berries the mouse will eat following her strategy.

Examples

Input


4 3
*..
.*.
..*
...


Output


3


Input


4 4
.*..
*...
...*
..*.


Output


2


Input


3 4
..**
*...
....


Output


1


Input


5 5
..*..
.....
**...
**...
**...


Output


1

Solution (in JAVA):

Solution:
import java.io.PrintWriter;
import java.util.Scanner;

public class Cakewalk {
    static int row;
    static int col;
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);

        row = sc.nextInt();
        col = sc.nextInt();
        char[][] table = new char[row+1][col+1];
        for (int i = 0; i < row; i++) {
            table[i] = sc.next().toCharArray();
        }
        Pair start = new Pair(0,0);
        int tot = 0;
        if (table[start.x][start.y] == '*'){
            table[start.x][start.y] = '.';
            tot++;
        }
        while (true){
            Pair close = closest(table,start);
            if (close != null) {
                start = close;
                table[start.x][start.y] = '.';
                tot++;
            } else {
                break;
            }
        }
        pw.println(tot);
        pw.flush();
    }

    static Pair closest(char[][] table, Pair start){
        if (start.x >= row || start.y >= col) return null;
        if (table[start.x][start.y]=='*'){
            return start;
        }
        Pair closeRight = closest(table,new Pair(start.x,start.y+1));
        Pair closeLeft = closest(table,new Pair(start.x+1,start.y));
        if (closeLeft == null && closeRight == null){
            return null;
        } else if (closeLeft == null) {
            return closeRight;
        } else if (closeRight == null) {
            return closeLeft;
        } else {
            if (dist(start,closeRight)<=dist(start,closeLeft)){
                return closeRight;
            } else {
                return closeLeft;
            }
        }
    }

    static int dist (Pair p1, Pair p2){
        return Math.abs(p1.x-p2.x)+Math.abs(p1.y-p2.y);
    }



    static class Pair {
        public int x,y;

        public boolean equals(Pair p) {
            return this.x==p.x && this.y==p.y;
        }
        public Pair(int x, int y) {
            this.x = x;
            this.y = y;
        }
    }
}