#include<bits/stdc++.h>
#define F(i,l,r) for(int i=(l),i##end=(r);i<=i##end;++i)
#define G(i,l,r) for(int i=(l),i##end=(r);i>=i##end;--i)
#define pii pair<int,int>
#define x first
#define y second
#define mp(x,y) make_pair(x,y)
#define ep emplace_back
using namespace std;
typedef long long ll;
string s[1000];
int w[1000][1000];
int main()
{
	cin.tie(0)->sync_with_stdio(false);
	int n,m,ans=0;
	cin>>n>>m;
	F(i,0,n-1)cin>>s[i];
	F(j,0,m-1)
	{
		int lst=0;
		G(i,n-1,0)if(s[i][j]=='+')ans+=lst++;
	}
	cout<<ans<<'\n';
	return 0;
}
/*
14 17
....+---+---+....
.../   /   /|....
..+---+---+ |....
./ /| | +---+
+---+ | |/ /|
|   | +---+---+ |
|   |/   /|   | +
+---+---+ |   |/|
|   |   | +---+ |
|   |   |/   /| +
+---+---+---+ |/.
|   |   |   | +..
|   |   |   |/...
+---+---+---+....
*/