#include <bits/stdc++.h>
#define LL long long 
#define mod %

using namespace std;

const int MAXN = 1e5 + 5;

LL n, m, k, b[MAXN], a[MAXN];

inline void solve () {
    cin >> m >> n >> k;
    for (int i = 1; i <= n; i++)
        cin >> b[i];
    for (int i = 1; i <= n; i++)
        a[i] = b[i] - b[i - 1] - 1;
    LL ans = 0;
    bool flag = true;
    for (int i = n; i >= 1;) {
        int j = i;
        for (int d = 1; d <= k && j >= 1; d++) {
            if (flag) { 
                ans ^= a[j];
                //cout << "pos = " << j << endl;
            }
            j--;
        }
        i = j - 1;
        flag ^= 1;
    }
    //cout << "sg = " << ans << endl;
    if (!ans) {
        cout << "Nova" << endl;
    } else {
        cout << "Twinkle" << endl;
    }
}

int main () {
    ios_base::sync_with_stdio (false);
    cin.tie (nullptr);
    cout.tie (nullptr);
    solve ();
    return 0;
}