#![allow(unused_imports, unused_macros, dead_code)]

macro_rules! min {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| min!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = min!($($ys),*);
        if $x < t { $x } else { t }
    }}
}
macro_rules! max {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| max!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = max!($($ys),*);
        if $x > t { $x } else { t }
    }}
}
macro_rules! ewriteln {
    ($($args:expr),*) => { let _ = writeln!(&mut std::io::stderr(), $($args),*); };
}
macro_rules! trace {
    ($x:expr) => { ewriteln!(">>> {} = {:?}", stringify!($x), $x) };
    ($($xs:expr),*) => { trace!(($($xs),*)) }
}
macro_rules! put {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        if let Some(x) = it.next() { print!("{}", x); }
        for x in it { print!(" {}", x); }
        println!("");
    }};
    ($x:expr) => { println!("{}", $x) };
    ($x:expr, $($xs:expr),*) => { print!("{} ", $x); put!($($xs),*) }
}

const M: i64 = 1_000_000_007;

fn main() {
    let mut sc = Scanner::new();
    let h: usize = sc.cin();
    let w: usize = sc.cin();
    let f: Vec<_> = (0..h).map(|_| sc.chars()).collect();

    let mut left = vec![vec![0; w]; h];
    let mut up = vec![vec![0; w]; h];
    let mut right = vec![vec![0; w]; h];
    let mut down = vec![vec![0; w]; h];

    for i in 0..h {
        for j in 0..w {
            left[i][j] = if j == 0 {
                0
            } else {
                if f[i][j-1] == '#' {
                    0
                } else {
                    left[i][j - 1] + 1
                }
            };
            up[i][j] = if i == 0 {
                0
            } else {
                if f[i-1][j] == '#' {
                    0
                } else {
                    up[i-1][j] + 1
                }
            };
        }
    }

    for i in (0..h).rev() {
        for j in (0..w).rev() {
            right[i][j] = if j == w-1 {
                0
            } else {
                if f[i][j+1] == '#' {
                    0
                } else {
                    right[i][j + 1] + 1
                }
            };
            down[i][j] = if i == h - 1 {
                0
            } else {
                if f[i + 1][j] == '#' {
                    0
                } else {
                    down[i + 1][j] + 1
                }
            };
        }
    }

    let mut ans = 0;

    for i in 0..h {
        for j in 0..w {
            if f[i][j] == '#' { continue }
            ans = max!(ans,
                1
                + right[i][j]
                + left[i][j]
                + up[i][j]
                + down[i][j]);
        }
    }
    put!(ans);

}

use std::io::{self, Write};
use std::str::FromStr;
use std::collections::VecDeque;

struct Scanner { stdin: io::Stdin, buffer: VecDeque<String>, }
impl Scanner {
    fn new() -> Self { Scanner { stdin: io::stdin(), buffer: VecDeque::new() } }
    fn cin<T: FromStr>(&mut self) -> T {
        while self.buffer.len() == 0 {
            let mut line = String::new();
            let _ = self.stdin.read_line(&mut line);
            for w in line.split_whitespace() {
                self.buffer.push_back(String::from(w));
            }
        }
        self.buffer.pop_front().unwrap().parse::<T>().ok().unwrap()
    }
    fn chars(&mut self) -> Vec<char> { self.cin::<String>().chars().collect() }
    fn vec<T: FromStr>(&mut self, n: usize) -> Vec<T> { (0..n).map(|_| self.cin()).collect() }
}


Measured memory_bytes: 86268