#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define int long long
template<class T>using pq = priority_queue<T>;
template<class T>using pqg = priority_queue<T, vector<T>, greater<T>>;
vector<vector<int>>ans(15);
int pos=1;
int SG(vector<int>sg)
{
	int n=sg.size();
	int g=0;
	for(int i=n-1;i>=0;i-=2)
	{
		g^=sg[i];
	}
	return g;
}
void solve()
{
	int n,m,k;
	cin>>n>>m>>k;
	vector<int>szh;
    for(int i=0;i<m;i++)
	{
		int key;
		cin>>key;
		szh.push_back(key-pos);
		pos=key;
	}
	for(int i=0;i<m;i++)
	{
		 ans[i%k].push_back(szh[i]);
	}
	int g=0;
	for(int i=0;i<k;i++)
	{
			g^=SG(ans[i]);
	}
	if(!g)cout<<"Nova"<<endl;
	else cout<<"Twinkle"<<endl;
	
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int T;
	T=1;
	while(T--)solve();
	return 0;
}