能不能给出一组hack。

#include<bits/stdc++.h>
#define ll long long
using namespace std;
unsigned ll n,k;
unsigned ll a[1001000],s[1001000];
int main(){
    cin>>n>>k;
    for (unsigned ll i=1;i<=n;i++){
        cin>>a[i];
        if (a[i]<a[i-1])
            s[i]=s[i-1]+1;
        else
            s[i]=1;
        //cout<<s[i]<<" ";
    }
    //cout<<endl;
    for (unsigned ll i=k;i<=n;i++)
        cout<<min(k,s[i])<<endl;
}