#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const double PI = acos(-1.0);
const int MAXN = 1e5 + 5;
const int MAXM = 2e6 + 5;
const int MOD = 1e9 + 7;
int sgn(double x) {
  if (fabs(x) < eps) return 0;
  if (x < 0)
    return -1;
  else
    return 1;
}
long long pw(long long a, long long n, long long mod) {
  long long ret = 1;
  while (n) {
    if (n & 1) ret = ret * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return ret;
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
void inc(long long &a, long long b) {
  a += b;
  if (a >= MOD) a -= MOD;
}
void dec(long long &a, long long b) {
  a -= b;
  if (a < 0) a += MOD;
}
int mul(int a, int b) {
  long long c = 1ll * a * b;
  return c - c / MOD * MOD;
}
int n, m, a[MAXN], b[MAXN], v[MAXN], to[MAXN], fa[MAXN], h[MAXN];
int find(int x) {
  if (x == fa[x]) return x;
  int f = find(fa[x]);
  h[x] += h[fa[x]];
  return fa[x] = f;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i < n + 1; i++) scanf("%d", &to[i]), fa[i] = i;
  for (int i = 1; i < m + 1; i++) scanf("%d", &v[i]);
  for (int i = 1; i < m + 1; i++) scanf("%d", &b[i]);
  int last = 0, x, y;
  for (int i = 1; i < m + 1; i++) {
    x = (v[i] + last - 1) % n + 1, last = 0;
    while (b[i]) {
      y = find(x);
      if (x == y) {
        if (h[x] == 0) {
          last++;
          b[i]--;
          if (x == find(to[x])) {
            h[x] = INF;
            break;
          } else {
            fa[x] = to[x];
            h[x] = 1;
            x = to[x];
          }
        } else
          break;
      } else {
        if (h[x] < b[i]) {
          b[i] -= h[x];
          x = y;
        } else
          break;
      }
    }
    printf("%d\n", last);
  }
}
