#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;

int n, k, a[N], dep[N], cnt[N], ans;
vector<int> g[N];
bool flag = 1;

void dfs(int u) {
    for (int v : g[u]) dfs(v);

}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 2, fa; i <= n; i++) {
        cin >> fa, fa++, g[fa].push_back(i);
        flag &= fa == i - 1;
    }
    if (flag) {
        for (int i = n; i >= 1; i--) {
            cnt[a[i]]++;
            ans = max(ans, cnt[a[i]]);
        }
        cout << ans << " 0";
    } else if (n <= 2000) {
        dfs(1);
    }
    return 0;
}