#include <bits/stdc++.h>

using namespace std;

const int N = 8e5 + 5;

vector<int> G[N];
int fa[N], cur[N], in[N], out[N], ord[N << 1], ord_c;
vector< pair<long long, int> > qry;
int res[N];

void dfs(int x) {
    if (fa[x]) {
        int ini = G[x][0];
        rotate(G[x].begin(), find(G[x].begin(), G[x].end(), fa[x]), G[x].end());
        cur[x] = find(G[x].begin(), G[x].end(), ini) - G[x].begin();
    }
    in[x] = out[x] = ++ord_c, ord[ord_c] = x;
    for (auto v : G[x]) {
        if (v == fa[x]) continue;
        fa[v] = x, dfs(v);
        out[x] = ++ord_c, ord[ord_c] = x;
    }
}

int usd[N];
long long clk;

void Dfs(int x) {
    while (qry.back().first == clk) {
        res[qry.back().second] = x;
        qry.pop_back();
    }
    if (!usd[x]) {
        usd[x] = (cur[x] == 0);
        for (auto v : G[x]) {
            if (v != fa[x]) usd[x] &= usd[v];
        }
    }
    if (usd[x]) {
        if (x == 1) {
            while (!qry.empty()) {
                res[qry.back().second] = ord[(qry.back().first - clk) % (out[x] - in[x]) + 1];
                qry.pop_back();
            }
            return;
        }
        while (!qry.empty() && qry.back().first <= clk + (out[x] - in[x])) {
            res[qry.back().second] = ord[in[x] + (qry.back().first - clk)];
            qry.pop_back();
        }
        clk += out[x] - in[x];
        ++clk;
        Dfs(G[x][0]);
        return;
    }
    ++clk;
    cur[x] = (cur[x] + 1) % G[x].size();
    Dfs(G[x][cur[x]]);
}

signed main() {
    int n, q; scanf("%d%d", &n, &q);
    for (int i = 1; i <= n; ++i) {
        int x; scanf("%d", &x), G[i].resize(x);
        for (auto &t : G[i]) scanf("%d", &t);
        cur[i] = 0;
    }
    for (int i = 1; i <= q; ++i) {
        long long x; scanf("%lld", &x);
        qry.push_back({x, i});
    }
    sort(qry.rbegin(), qry.rend());
    dfs(1), Dfs(1);
    for (int i = 1; i <= q; ++i) printf("%d\n", res[i]);
    return 0;
}