#include <bits/stdc++.h>
using namespace std;

#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define dbg3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define dbgB(value, size) cerr<<#value<<": "<<bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;

const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }

template<typename T>
void print1(T begin, T end) {
	while (begin != end) {
		cerr << (*begin) << " ";
		*begin++;
	}
	cerr << endl;
}

template<typename T>
void print2(T Array, int height, int width) {
	for (int i = 0; i < height; i++) {
		for (int j = 0; j < width; j++) {
			cerr << " " << Array[i][j];
		}
		cerr << endl;
	}
}

void print() { std::cerr << endl; }
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
	std::cerr << head << " ";
	print(std::forward<Tail>(tail)...);
}

template<class T>
void Add(T &a, const T &b, const T &mod=1000000007) {
	int val = ((a % mod) + (b % mod)) % mod;
	if (val < 0) { val += mod; }
	a = val;
}

template <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

// ------------------------------------------------------------------------------------------

int H, W;
char B[2222][2222];
int u[2222][2222];
int d[2222][2222];
int r[2222][2222];
int l[2222][2222];

signed main() {
	cin >> H >> W;
	rep (i, H) {
		rep (j, W) {
			cin >> B[i][j];
			u[i][j] = B[i][j] == '.';
			d[i][j] = B[i][j] == '.';
			r[i][j] = B[i][j] == '.';
			l[i][j] = B[i][j] == '.';
		}
	}

	for (int i = 0; i < W; i++) {
		for (int j = 1; j < H; j++) {
				if (!d[j][i]) continue;
				d[j][i] += d[j-1][i];
		}
	}
	for (int i = 0; i < W; i++) {
		for (int j = H-1; j >= 0; j--) {
				if (!u[j][i]) continue;
				u[j][i] += u[j+1][i];
		}
	}
	for (int i = 0; i < H; i++) {
		for (int j = 1; j < W; j++) {
				if (!r[i][j]) continue;
				r[i][j] += r[i][j-1];
		}
	}
	for (int i = 0; i < H; i++) {
		for (int j = W-1; j >= 0; j--) {
				if (!l[i][j]) continue;
				l[i][j] += l[i][j+1];
		}
	}

	int ans = 0;
	rep (i, H) {
		rep (j, W) {
			if (B[i][j] == '#') continue;
			int t = u[i][j] + d[i][j] + l[i][j] + r[i][j] - 3;
			chmax(ans, t);
		}
	}

	cout << ans << endl;

/*
	print2(d, H, W);
	line()
	print2(u, H, W);
	line()
	print2(r, H, W);
	line()
	print2(l, H, W);
	*/


	return 0;
}

Measured memory_bytes: 150656