Problem:
Score : 400 points

Problem Statement

There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares.

Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it.
The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and right.
In each direction, the beam will continue traveling until it hits a square occupied by an obstacle or it hits the border of the grid. It will light all the squares on the way, including the square on which the lamp is placed, but not the square occupied by an obstacle.

Snuke wants to maximize the number of squares lighted by the lamp.

You are given H strings S_i (1 \leq i \leq H), each of length W. If the j-th character (1 \leq j \leq W) of S_i is #, there is an obstacle on the square at the i-th row from the top and the j-th column from the left; if that character is ., there is no obstacle on that square.

Find the maximum possible number of squares lighted by the lamp.

Constraints

1 \leq H \leq 2,000

1 \leq W \leq 2,000

S_i is a string of length W consisting of # and ..

. occurs at least once in one of the strings S_i (1 \leq i \leq H).

Input

Input is given from Standard Input in the following format:

H W
S_1
:
S_H

Output

Print the maximum possible number of squares lighted by the lamp.

Sample Input 1

4 6
#..#..
.....#
....#.
#.#...

Sample Output 1

8

If Snuke places the lamp on the square at the second row from the top and the second column from the left, it will light the following squares: the first through fifth squares from the left in the second row, and the first through fourth squares from the top in the second column, for a total of eight squares.

Sample Input 2

8 8
..#...#.
....#...
##......
..###..#
...#..#.
##....#.
#...#...
###.#..#

Sample Output 2

13

Solution in LuaJIT (2.0.4) (judge verdict: Accepted)

local H, W = io.read("*n", "*n", "*l")

local function mk2d()
    local t = {}
    for i=1,H do
        t[i] = {}
    end
    return t
end

local grid = mk2d()
for i=1,H do
    local s = io.read("*l")
    local line = grid[i]
    for j=1,W do
        line[j] = string.sub(s, j, j) == '#' and 1 or 0
    end
end

local U = mk2d()
local D = mk2d()
local L = mk2d()
local R = mk2d()

-- L
for i=1,H do
    local line = grid[i]
    local target = L[i]
    local cnt = 0
    for j=1, W do
        local a = line[j]
        if a == 0 then
            cnt = cnt + 1
        else
            cnt = 0
        end
        target[j] = cnt
    end
end
-- R
for i=1,H do
    local line = grid[i]
    local target = R[i]
    local cnt = 0
    for j=W, 1, -1 do
        local a = line[j]
        if a == 0 then
            cnt = cnt + 1
        else
            cnt = 0
        end
        target[j] = cnt
    end
end
-- U
for j=1,W do
    local cnt = 0
    for i=1,H do
        local a = grid[i][j]
        if a == 0 then
            cnt = cnt + 1
        else
            cnt = 0
        end
        U[i][j] = cnt
    end
end
-- D
for j=1,W do
    local cnt = 0
    for i=H,1,-1 do
        local a = grid[i][j]
        if a == 0 then
            cnt = cnt + 1
        else
            cnt = 0
        end
        D[i][j] = cnt
    end
end

local function count(i, j)
    if grid[i][j] == 1 then
        return -1
    else
        local a = L[i][j] + R[i][j] + U[i][j] + D[i][j] - 3
        return a
    end
end

local ans = 0
for i=1,H do
    for j=1,W do
        ans = math.max(ans, count(i, j))
    end
end
print(ans)