#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxn=2e5+10;
int x[maxn];

void solve(){
    int n,m,k;
    cin>>m>>n>>k;
    for(int i=1;i<=n;i++) cin>>x[i];
    int sg=0;
    for(int i=n;i>0;i--){
        int tmp=x[i]-x[i-1]-1;
        if((i/k)%2==0) sg=sg^tmp;
    }
    if(sg) cout<<"Twinkle";
    else cout<<"Nova";
}

int main(){
    std::ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int t;
    t=1;
    while(t--){
        solve();
    }
    return 0;
}