#include <bits/stdc++.h>
#define int long long
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

void solve() {
    int n,m,k; cin >> m >> n >> k;
    
    vector<int> stks;
    {
        int now = 1;
        for (int i = 0; i < n; i++) {
            int x; cin >> x;
            stks.emplace_back(x - now);
            now = x + 1;
        }
    }

    vector<vector<int>> a(k);
    for (int i = 0; i < n; i++)
        a[i % k].emplace_back(stks[i]);

    auto grundy = [&](const vector<int>& a) {
        const int n = (int)a.size();
        int g = 0;
        for (int i = n - 1; i >= 0; i -= 2)
            g ^= a[i];
        return g;
    };

    int g = 0;
    for (int i = 0; i < k; i++)
        g ^= grundy(a[i]);

    const string FIRST = "Twinkle";
    const string SECOND = "Nova";

    cout << (g > 0 ? FIRST : SECOND) << '\n';
}

signed main() {
#ifndef LOCAL
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int T = 1;
    // cin >> T;
    while (T--) solve();
}