영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
You are given an array that contains each number between 1 … n exactly once. You collect the numbers in increasing order from 1 to n. On each round, you traverse the array from left to right and collect as many consecutive numbers as possible, starting from the smallest number that has not been collected yet.
Your task is to determine, for each k=1,2,…,n, the number of arrays that require exactly k rounds to collect all the numbers.
Input
The only line has an integer n.
Output
Print n numbers: for each k=1,2,…,n, the answer modulo 10^9+7.
Constraints
- 1 ≤ n ≤ 5000
Example
Explanation: The arrays are [1,2,3] (1 round), [1,3,2] (2 rounds), [2,1,3] (2 rounds), [2,3,1] (2 rounds), [3,1,2] (2 rounds), and [3,2,1] (3 rounds).
예제
예제 1
3
1 4 1