영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
You are given a map of a forest where some squares are empty and some squares have trees.
You want to place a rectangular building in the forest so that no trees need to be cut down. For each building size, your task is to calculate the number of ways you can do this.
Input
The first input line contains integers n and m: the size of the forest.
After this, the forest is described. Each square is empty (.) or has trees (*).
Output
Print n lines each containing m integers.
Constraints
- 1 ≤ n,m ≤ 1000
Example
Explanation: For example, there are 5 possible places for a building of size 2 × 4.
예제
예제 1
4 7 ...*.*. .*..... ....... ......*
24 17 13 9 6 3 1 16 9 7 5 3 1 0 9 3 2 1 0 0 0 3 0 0 0 0 0 0