#include"bits/stdc++.h"

using namespace std; 

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
typedef priority_queue<LL> PQ_DESC;
typedef priority_queue<LL, VL, greater<LL>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef priority_queue<VL> PQ_DESC_VL;
typedef priority_queue<VL, vector<VL>, greater<VL>> PQ_ASC_VL;
typedef priority_queue<PLL> PQ_DESC_PLL;
typedef priority_queue<PLL, vector<PLL>, greater<PLL>> PQ_ASC_PLL;

#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define MP make_pair
#define SORT_ASC(c) sort(ALL(c))
//#define SORT_DESC(c) sort(ALL(c), greater<typeof(*((c).begin()))>())
#define SORT_DESC(c) sort((c).rbegin(),(c).rend())
#define REV(c) reverse((c).begin(), (c).end())
#define SIZE(a) int((a).size())

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ROF(i,a,b) for(int i=(b-1);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define PER(i,n) ROF(i,0,n)

const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int LARGE_INT = 1e9+100;
const int INF = 2e9+100;
const LL INF_LL = (LL)INF*(LL)INF;
const int MOD = 1e9+7;

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

LL modpow(LL a, LL n) {
    LL res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % MOD;
        a = a * a % MOD;
        n >>= 1;
    }
    return res;
}

void Main()
{
    LL n,k;cin>>n>>k;
    VL p(n);
    REP(i,n){
        cin>>p[i];
        p[i]--;
    }
    VL c(n);
    REP(i,n){
        cin>>c[i];
    }

    VVL loop(n);

    REP(start,n){
        LL point = 0;
        LL now = start;
        LL count = 0;
        while(true){
            LL next = p[now];
            point += c[next];
            count++;

            now = next;
            if(now == start){
                loop[start] = {point,count};
                break;
            }
        }
    }

    //REP(i,n){
    //    cerr<<loop[i][0]<<" "<<loop[i][1]<<endl;
    //}

    LL result = -INF_LL;
    //LL one_result = -INF_LL;
    
    //bool ff = false;
    
    REP(i,n){
        LL point = 0;
        LL now = i;
        REP(j,min(k,loop[i][1])){
            LL next = p[now];
            point += c[next];
            now = next;
            result = max(result,point);
        }

    }


    REP(i,n){
        //bool f = false;
        LL kk = k;
        LL point = loop[i][0] * (kk/loop[i][1]);
        kk %= loop[i][1];
        LL now = i;
        REP(j,min(kk,loop[i][1])){
            LL next = p[now];
            point += c[next];
            now = next;
            result = max(result,point);
        }
    }
    
    REP(i,n){
        //bool f = false;
        LL kk = k;
        LL point = 0;
        if(kk >= loop[i][1]){
            point = loop[i][0] * ((kk/loop[i][1])-1);
            kk %= loop[i][1];
            kk += loop[i][1];
        }
        LL now = i;
        REP(j,min(kk,loop[i][1])){
            LL next = p[now];
            point += c[next];
            now = next;
            result = max(result,point);
        }
    }

    cout<<result<<endl;

	return;
}

int main()
{
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(15);
	Main();
    return 0;
}


Measured memory_bytes: 3892