//Lib
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<ctime>
 
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<queue>
#include<set>
#include<map>
using namespace std;
//Macro
#define rep(i,a,b)  for(int i=a,tt=b;i<=tt;++i)
#define drep(i,a,b) for(int i=a,tt=b;i>=tt;--i)
#define erep(i,e,x) for(int i=x;i;i=e[i].next)
#define irep(i,x)   for(__typeof(x.begin()) i=x.begin();i!=x.end();i++)
#define read()  (strtol(ipos,&ipos,10))
#define sqr(x)  ((x)*(x))
#define pb  push_back
#define PS  system("pause");
typedef long long   ll;
typedef pair<int,int> pii;
const int oo=~0U>>1;
const double inf=1e100;
const double eps=1e-6;
string name="", in=".in", out=".out";
//Var
multiset<int>MinT;
multiset<int,greater<int> >MaxT;
int n,m,k,num[1000008];
void Init()
{
    scanf("%d%d%d",&n,&m,&k);
    rep(i,1,n)scanf("%d",num+i);
    rep(i,1,m)MaxT.insert(num[i]),MinT.insert(num[i]);
}
void Work()
{
    bool flag=false;
    for(int pos=1;pos<=n-m+1;pos++)
    {
        if(*(MaxT.begin())-*(MinT.begin())<=k)printf("%d\n",pos),flag=true;
        MaxT.erase(MaxT.find(num[pos])),
        MinT.erase(MinT.find(num[pos]));
        MaxT.insert(num[pos+m]),
        MinT.insert(num[pos+m]);
    }
    if(!flag)printf("NONE\n");
}
int main()
{
//  freopen((name+in).c_str(),"r",stdin);
//  freopen((name+out).c_str(),"w",stdout);
    Init();
    Work();
    return 0;
}