#include<cstdio>

#include<algorithm>

#include<cstring>

#define N 1000005

using namespace std;

int n,m,c,Q[N],q[N],a[N],Ql,Qr,ql,qr,OK;

int main()

{

    scanf("%d%d%d",&n,&m,&c);

    for (int i=;i<=n;i++)

        scanf("%d",a+i);

    q[]=Q[]=;

    for (int i=;i<=n;i++)

    {

        while (Ql<=Qr && Q[Ql]<=i-m) Ql++;

        while (ql<=qr && q[ql]<=i-m) ql++;

        while (Ql<=Qr && a[Q[Qr]]<a[i]) Qr--;Q[++Qr]=i;

        while (ql<=qr && a[q[qr]]>a[i]) qr--;q[++qr]=i;

        if (a[Q[Ql]]-a[q[ql]]<=c && i>=m) OK=,printf("%d\n",i-m+);

    }

    if (!OK) puts("NONE");

    return ;

}