#include <iostream>
#include <deque>
using namespace std;
int a[100005];
long long int trya(deque<long long int> v) {
    while (!v.empty() && v.front() == 0) v.pop_front();
    if (v.empty()) return 0;
    if (v.size() == 1) return v[0];
    if (v.size() == 2) return v[1];
    deque<long long int> vv, va, vb;
    vv.push_back(v[0]);
    for (int i = 1; i < v.size(); i++) {
        vv.push_back(v[i] + v[i - 1]);
    }
    vv.push_back(v.back());
    for (int i = 0; i < vv.size(); i++) {
        if (i & 1) vb.push_back(vv[i]);
        else va.push_back(vv[i]);
    }
    return (trya(va) ^ trya(vb));
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int m, n, k;
    cin >> m >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = n; i >= 1; i--) {
        a[i] = a[i] - a[i - 1] - 1;
    }
    long long int res = 0;
    for (int i = 1; i <= k; i++) {
        deque<long long int> v;
        for (int j = i; j <= n; j += k) {
            v.push_back(a[j]);
        }
        res ^= trya(v);
    }
    if (res == 0) cout << "Nova";
    else cout << "Twinkle";
}