#include <bits/stdc++.h>
#define dbg(x) cerr<< (#x) << ":" << x << endl
using namespace std;
using ll = long long;
using ull = unsigned long long;
map<vector<int>, int> sg;
int n, m, k;
int SG(vector<int> x) {
    auto Jud = [&]() {
        for (int i = 0; i < n; i++) {
            if (x[i]) return 0;
        }
        return 1;
    };
    if (sg.count(x)) return sg[x];
    if (Jud()) {
        return sg[x] = 0;
    }
    vector<int> vis(100);
    for (int i = 0; i < n; i++) {
        for (int j = 1; j <= x[i]; j++) {
            x[i] -= j;
            if (i + k < n)
                x[i + k] += j;
            vis[SG(x)] = 1;
            x[i] += j;
            if (i + k < n)
                x[i + k] -= j;
        }
    }
    for (int i = 0; ; i++) {
        if (!vis[i]) {
            sg[x] = i;
            break;
        }
    }
    return sg[x];
}
void print(vector<int> vec) {
    for (auto x: vec) {
        cout << x << ' ';
    }
    cout << sg[vec] << endl;
}
void Solve() {
    cin >> m >> n >> k;
    vector<int> vec(n);
    for (auto &x : vec) {
        cin >> x;
    }
    for (int i = vec.size() - 1; i >= 0; i--) {
        if (i)
            vec[i] = vec[i] - vec[i - 1] - 1;
        else vec[i]--;
    }
   //cout << SG(vec) << endl;
    if (SG(vec)) cout << "Twinkle\n";
    else cout << "Nova\n";
/*     for (auto [vec, val]: sg) {
        print(vec);
    } */
}
int main() {
   // freopen("in", "r", stdin);
    //freopen("out", "w", stdout);
    int T = 1;
    while (T--){
        Solve();
    }
    return 0;
}