class Solution(object):
    def maxInWindows(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: List[int]
        """
        als=[]
        n=len(nums)
        if n==1:
            return nums
        for x in range(n-k+1):
            als.append(max(nums[x:x+k]))
        # print(als)
        return als