CF261D Maxim and Increasing Subsequence

Maxim loves sequences, especially those that strictly increase. He is wondering, what is the length of the longest increasing subsequence of the given sequence $ a $ ? Sequence $ a $ is given as follows: - the length of the sequence equals $ n×t $ ; -  $ (1

The first line contains four integers $ k $ , $ n $ , $ maxb $ and $ t $ $ (1

Print $ k $ integers — the answers for the variants of the sequence $ a $ . Print the answers in the order the variants follow in the input.