// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <cstdio>
#include <random>
#include <limits>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

const int N = 1e5, inf = 2e18;
int a, b, t[N + 5];
vi s[N + 5], f[61][N + 5], g[61][N + 5];

void solve(int n, int m, int k) {
	m %= t[n];
	if(f[k][n][m]) return;
	// cout << k << ' ' << n << ' ' << m << ' ' << t[n] << endl;
	if(k) {
		solve(n, m, k - 1);
		if(t[f[k - 1][n][m]] == t[n]) {
			int o = (m + g[k - 1][n][m]) % t[n];
			solve(f[k - 1][n][m], o, k - 1);
			f[k][n][m] = f[k - 1][f[k - 1][n][m]][o];
			g[k][n][m] = min(inf, g[k - 1][n][m] + g[k - 1][f[k - 1][n][m]][o]);
		}
		else f[k][n][m] = f[k - 1][n][m], g[k][n][m] = g[k - 1][n][m];
		return;
	}
	int v = s[n][m], now = 1;
	while(1) {
		if(t[v] >= t[n]) {
			f[0][n][m] = v, g[0][n][m] = now;
			break;
		}
		else {
			// cout << "QWQ" << endl;
			solve(v, (m + now) % t[v], 60);
			int vv = f[60][v][(m + now) % t[v]];
			if(t[vv] > t[v]) now += g[60][v][(m + now) % t[v]], v = vv;
			else {
				f[0][n][m] = s[n][m], g[0][n][m] = 1;
				break;
			}
		}
	}
	// cerr << k << ' ' << n << ' ' << m << ' ' << v << ' ' << now << endl;
}

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> a >> b;
	rep(i, 1, a) {
		cin >> t[i], s[i].resize(t[i]);
		rep(j, 0, 60) f[j][i].resize(t[i]), g[j][i].resize(t[i]);
	}
	rep(i, 1, a) rep(j, 0, t[i] - 1) cin >> s[i][j];
	rep(i, 1, a) rep(j, 0, t[i] - 1) rep(k, 0, 60) solve(i, j, k);
	int x, y, z;
	rep(i, 1, b) {
		cin >> x >> y >> z;
		while(z) {
			if(z < g[0][x][y % t[x]]) {
				x = s[x][y % t[x]], ++y, --z;
				continue;
			}
			per(i, 60, 0) if(z >= g[i][x][y % t[x]]) {
				int v = f[i][x][y % t[x]];
				z -= g[i][x][y % t[x]];
				y += g[i][x][y % t[x]];
				x = v;
			}
			// cerr << i << ' ' << z << endl;
		}
		cout << x << '\n';
	}
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}