// Mahmud Isali
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
// #include <bits/extc++.h>
using namespace std;
// using namespace __gnu_pbds;
// #define int long long
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const long long INF = 1e18, MOD = 1e9 + 9, N = 5e5 + 10;
void solve() {
int n,k;
cin >> n >> k;
vector<int> a(n + 1, 0), s(n + 1, 0);
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 1; i <= n; i++) cin >> s[i];
while(k--) {
vector<int> na(n + 1, 0);
for(int i = 1; i <= n; i++) {
na[s[i]] += a[i];
}
swap(na,a);
}
int mx = *max_element(all(a));
vector<int> ans;
for(int i = 1; i <= n; i++) {
if(a[i] == mx)
ans.pb(i);
}
cout << mx << endl;
for(int x : ans) cout << x << ' ';
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t = 1;
// cin >> t;
for(int T = 1; T <= t; T++) {
solve();
}
}
