#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], cnt[M], lf[N][M], rt[N][M], a[N];
bool mark[M];
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 sc = 0, r = 0;
for (int i = 1; i <= n; ++i)
{
while (r < n && (cnt[a[r+1]] > 0 || sc < j))
{
++r;
++cnt[a[r]];
if (cnt[a[r]] == 1)
++sc;
}
if (sc < j)
{
fill(cnt+1, cnt+M, 0);
sc = 0;
break;
}
for (int x = 1; x < M; ++x)
if (rt[i][x] <= r)
{
int lb = rt[i][x], rb = lf[r][x];
auto itl = lower_bound(f[i], f[i]+j, make_pair(lb-1, -1));
auto itr = lower_bound(g[r], g[r]+j, make_pair(rb+1, INF), greater<pair<int, int>>());
int s = (itl->se)^(pfx[rb][x]^pfx[lb][x])^(itr->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};
--cnt[a[i]];
if (cnt[a[i]] == 0)
--sc;
}
sc = 0;
int l = n+1;
for (int i = n; i >= 1; --i)
{
while (l > 1 && (cnt[a[l-1]] > 0 || sc < j))
{
--l;
++cnt[a[l]];
if (cnt[a[l]] == 1)
++sc;
}
if (sc < j)
{
fill(cnt+1, cnt+M, 0);
sc = 0;
break;
}
for (int x = 1; x < M; ++x)
if (lf[i][x] >= l)
{
int lb = rt[l][x], rb = lf[i][x];
auto itl = lower_bound(f[l], f[l]+j, make_pair(lb-1, -1));
auto itr = lower_bound(g[i], g[i]+j, make_pair(rb+1, INF), greater<pair<int, int>>());
int s = (itl->se)^(pfx[rb][x]^pfx[lb][x])^(itr->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};
--cnt[a[i]];
if (cnt[a[i]] == 0)
--sc;
}
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 lb = rt[l][x], rb = lf[r][x];
int s = pfx[rb][x]^pfx[lb][x];
for (int j = 0; j < M; ++j)
if (f[l][j].fi == lb-1)
{
s ^= f[l][j].se;
break;
}
for (int j = 0; j < M; ++j)
if (g[r][j].fi == rb+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();
}
