class Solution:
def FirstNegativeInteger(self, arr, k):
n = len(arr)
ans = [0]*(n-k+1)
prev = -1
for i in range(n):
if arr[i] >= 0: continue
for beg in range(max(prev+1, i-k+1), min(i+1, n-k+1)):
ans[beg] = arr[i]
prev = i
return ans
Y2xhc3MgU29sdXRpb246CiAgICBkZWYgRmlyc3ROZWdhdGl2ZUludGVnZXIoc2VsZiwgYXJyLCBrKTogCiAgICAgICAgbiA9IGxlbihhcnIpCiAgICAgICAgYW5zID0gWzBdKihuLWsrMSkKICAgICAgICBwcmV2ID0gLTEKICAgICAgICBmb3IgaSBpbiByYW5nZShuKToKICAgICAgICAgICAgaWYgYXJyW2ldID49IDA6IGNvbnRpbnVlCiAgICAgICAgICAgIGZvciBiZWcgaW4gcmFuZ2UobWF4KHByZXYrMSwgaS1rKzEpLCBtaW4oaSsxLCBuLWsrMSkpOgogICAgICAgICAgICAgICAgYW5zW2JlZ10gPSBhcnJbaV0KICAgICAgICAgICAgcHJldiA9IGkKICAgICAgICByZXR1cm4gYW5z