#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define _F "what"
using namespace std;
typedef long long ll;
constexpr int N = 1e5 + 67, M = 33, INF = 1e9 + 67;
pair<int, int> f[N][M], g[N][M];
int n, q, pfx[N][M], lf[N][M], rt[N][M], a[N], idf[M], idl[M];
bool mark[M];
deque<int> idx[M];
set<int> curf, curl;
void solve()
{
int n, q; cin>>n>>q;
for (int i = 1; i <= n; ++i)
cin>>a[i];
fill(rt[n+1]+1, rt[n+1]+M, n+1);
for (int i = n; i >= 1; --i)
{
for (int j = 1; j < M; ++j)
rt[i][j] = rt[i+1][j];
rt[i][a[i]] = i;
}
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j < M; ++j)
lf[i][j] = lf[i-1][j];
lf[i][a[i]] = i;
}
for (int i = 1; i <= n; ++i)
f[i][0] = {i-1, 0}, g[i][0] = {i+1, 0};
for (int j = 1; j < M; ++j)
{
int r = 0;
for (int i = 1; i <= n; ++i)
{
while (r < n && (idx[a[r+1]].size() > 0 || curf.size() < j))
{
++r;
if (idx[a[r]].size() > 0)
curl.erase(idx[a[r]].back());
curl.insert(r);
idx[a[r]].pb(r);
if (idx[a[r]].size() == 1)
curf.insert(r);
}
if (curf.size() < j)
{
curf.clear(), curl.clear();
for (int h = 1; h < M; ++h)
idx[h].clear();
break;
}
int h = -1;
for (int id: curf)
idf[a[id]] = ++h;
for (int id: curl)
idl[a[id]] = h--;
for (int x = 1; x < M; ++x)
if (idx[x].size() > 0)
{
int s = (f[i][idf[x]].se)^(pfx[lf[r][x]][x]^pfx[rt[i][x]][x])^(g[r][idl[x]].se);
if (s < M)
mark[s] = true;
}
int s = 0;
for (; s < M; ++s)
if (!mark[s])
break;
fill(mark, mark+M, false);
f[i][j] = {r, s};
int k = idx[a[i]].front();
idx[a[i]].pop_front();
curf.erase(k), curl.erase(k);
if (idx[a[i]].size() > 0)
curf.insert(idx[a[i]].front());
}
int l = n+1;
for (int i = n; i >= 1; --i)
{
while (l > 1 && (idx[a[l-1]].size() > 0 || curf.size() < j))
{
--l;
if (idx[a[l]].size() > 0)
curf.erase(idx[a[l]].front());
curf.insert(l);
idx[a[l]].push_front(l);
if (idx[a[l]].size() == 1)
curl.insert(l);
}
if (curl.size() < j)
{
curf.clear(), curl.clear();
for (int h = 1; h < M; ++h)
idx[h].clear();
break;
}
int h = -1;
for (int id: curf)
idf[a[id]] = ++h;
for (int id: curl)
idl[a[id]] = h--;
for (int x = 1; x < M; ++x)
if (idx[x].size() > 0)
{
int s = (f[l][idf[x]].se)^(pfx[lf[i][x]][x]^pfx[rt[l][x]][x])^(g[i][idl[x]].se);
if (s < M)
mark[s] = true;
}
int s = 0;
for (; s < M; ++s)
if (!mark[s])
break;
fill(mark, mark+M, false);
g[i][j] = {l, s};
int k = idx[a[i]].back();
idx[a[i]].pop_back();
curf.erase(k), curl.erase(k);
if (idx[a[i]].size() > 0)
curl.insert(idx[a[i]].back());
}
for (int x = 1; x < M; ++x)
{
int pre = 1, k = 0;
for (int i = 1; i <= n; ++i)
{
if (a[i] == x)
{
pfx[i][x] = pfx[i-1][x];
if (i < n && a[i+1] != x)
{
fill(mark+1, mark+M, false);
mark[a[i+1]] = true;
pre = i+1;
k = 0;
}
}
else if (i == n || !mark[a[i+1]])
{
pfx[i][x] = pfx[pre-1][x]^(f[pre][++k].se);
if (i < n)
mark[a[i+1]] = true;
}
}
fill(mark+1, mark+M, false);
}
}
// for (int j = 1; j <= 4; ++j)
// {
// for (int i = 1; i <= n; ++i)
// cout<<f[i][j].se<<" ";
// cout<<endl;
// }
// cout<<endl;
// for (int j = 1; j <= 4; ++j)
// {
// for (int i = 1; i <= n; ++i)
// cout<<g[i][j].se<<" ";
// cout<<endl;
// }
// cout<<endl;
// for (int j = 1; j <= 4; ++j)
// {
// for (int i = 1; i <= n; ++i)
// cout<<pfx[i][j]<<" ";
// cout<<endl;
// }
// cout<<endl;
while (q--)
{
int l, r; cin>>l>>r;
bool flag = false;
for (int x = 1; x < M; ++x)
if (rt[l][x] <= r)
{
int a = rt[l][x], b = lf[r][x];
int s = pfx[b][x]^pfx[a][x];
for (int j = 0; j < M; ++j)
if (f[l][j].fi == a-1)
{
s ^= f[l][j].se;
break;
}
for (int j = 0; j < M; ++j)
if (g[r][j].fi == b+1)
{
s ^= g[r][j].se;
break;
}
if (s == 0)
flag = true;
}
cout<<(flag ? "Toni\n" : "Jakov\n");
}
}
int main()
{
if (fopen(_F".INP", "r"))
{
freopen(_F".INP", "r", stdin);
freopen(_F".OUT", "w", stdout);
}
else if (fopen("test.inp", "r"))
{
freopen("test.inp", "r", stdin);
freopen("test.out", "w", stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
int Test = 1; //cin>>Test;
while (Test--) solve();
}
