ソースコード
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(b);i>(a);--i)
#define eper(i,a,b) for(int i=((int)(a));i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF (1<<28)-1
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}
int n, h, w;
char g[11][11];
int ans1[100], ans2[100];
int main() {
ios::sync_with_stdio ( false );
cin.tie ( 0 );
cin >> n >> h >> w;
rep(i, 0, h) rep(j, 0, w) cin >> g[i][j];
erep(item, 1, n) {
rep(i, 0, h) {
rep(j, 0, w-item+1) {
bool flag = true;
rep(k, j, j+item) {
if (g[i][k] == '#') flag = false;
}
if (flag) {
ans1[item-1]++;
j += item-1;
}
}
}
rep(i, 0, w) {
rep(j, 0, h-item+1) {
bool flag = true;
rep(k, j, j+item) {
if (g[i][k] == '#') flag = false;
}
if (flag) {
ans2[item-1]++;
j += item-1;
}
}
}
}
rep(i, 0, n) cout << max(ans1[i], ans2[i]) << endl;
return 0;
}