CF837F Prefix Sums

Consider the function $ p(x) $ , where $ x $ is an array of $ m $ integers, which returns an array $ y $ consisting of $ m+1 $ integers such that $ y_{i} $ is equal to the sum of first $ i $ elements of array $ x $ ( $ 0

The first line contains two integers $ n $ and $ k $ ( $ 2

Print the minimum $ i $ such that $ A^{i} $ contains a number which is larger or equal than $ k $ .