Binod And Subarray

Binod is a youtuber and he is busy in the fame of social media so he asked you to help him solve a problem. You have been given an array of $positive$ $integers$ $a_{1},a_{2},a_{3},...,a_{i},...,a_{n}$ of size n.You have to find the smallest length of the subarray such that the length of the subarray must be $strictly$ greater than k and it's sum also must be $strictly$ greater than s. ###I