ソースコード
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
int in() { int x; scanf("%d", &x); return x; }
ll lin() { ll x; scanf("%lld", &x); return x; }
VI calc(vector<string> s, int n){
int h = s.size();
int w = s[0].size();
VI ret(n);
REP(x,n){
int l = x + 1;
vector<string> t(s);
REP(i,h){
REP(j,w-l+1){
bool ok = true;
FOR(jj,j,j+l-1) if (s[i][jj] == '#') ok = false;
if (ok){
ret[x]++;
FOR(jj,j,j+l-1) s[i][jj] = '#';
}
}
}
s = t;
}
return ret;
}
int main() {
int n, h, w;
cin >> n >> h >> w;
vector<string> s(h);
REP(i,h) cin >> s[i];
VI ans = calc(s, n);
REP(i,n) cout << ans[i] << endl;
// vector<string> t(w);
// REP(j,w) REP(i,h) t[j] += s[i][j];
// VI ans2 = calc(t, n);
// REP(i,n) cout << min(ans[i], ans2[i]) << endl;
return 0;
}