ソースコード
#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 main() {
ios::sync_with_stdio ( false );
cin.tie ( 0 );
cin >> n >> h >> w;
vector<int> cnt;
rep(i, 0, h) rep(j, 0, w) cin >> g[i][j];
rep(i, 0, h) g[i][w] = '#';
rep(i, 0, h) {
int counter = 0;
rep(j, 0, w+1) {
if (g[i][j] == '#') {
cnt.pb(counter);
counter = 0;
} else
counter++;
}
}
erep(i, 1, n) {
int ans = 0;
rep(j, 0, cnt.size()) {
int p = cnt[j];
ans += p / i;
}
cout << ans << endl;
}
return 0;
}