import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
 
public class Main {
 
    void solve() throws IOException {
        int N = ni();
        int K = ni();
        int[] P = new int[N];
        int[] C = new int[N];
        for (int i = 0; i < N; i++) {
            P[i] = ni()-1;
        }
        for (int i = 0; i < N; i++) {
            C[i] = ni();
        }
        long ans = -Long.MAX_VALUE;
        for (int i = 0; i < N; i++) {
            HashSet<Integer> visited = new HashSet<>();
            int current = i;
            int count = 0;
            long cost = 0;
            while(true){
                visited.add(current);
                count++;
                current = P[current];
                cost += C[current];
                ans = Math.max(ans, cost);
                // System.out.println(current);
                // System.out.println(cost);
                if(visited.contains(current) || count>=K) break;
            }
            if(count < K && cost>0){
                long sumcost = cost * (K/count-1);
                ans = Math.max(ans, sumcost);
                int rest = K%count + count;
                for (int j = 0; j < rest; j++) {
                    current = P[current];
                    sumcost += C[current];
                    ans = Math.max(ans, sumcost);
                }
            }else if(count < K && cost<=0){
                long sumcost = 0;
                int rest = K%count;
                for (int j = 0; j < rest; j++) {
                    current = P[current];
                    sumcost += C[current];
                    ans = Math.max(ans, sumcost);
                }
            }
            // System.out.println();

        }
 
        out.println(ans);
    }

    final int mod = 1000000007;
    final BigInteger MOD = BigInteger.valueOf(mod);
    int upperBound(ArrayList<Long> list, Long target){
        int i = Collections.binarySearch(list, target, new UpperBoundComparator<Long>());
        return ~i;
    }
    class UpperBoundComparator<T extends Comparable<? super T>> implements Comparator<T>{
        public int compare(T x, T y){
            return (x.compareTo(y) > 0) ? 1 : -1;
        }
    }
    int lowerBound(ArrayList<Long> list, Long target){
        int i = Collections.binarySearch(list, target, new LowerBoundComparator<Long>());
        return ~i;
    }
    class LowerBoundComparator<T extends Comparable<? super T>> implements Comparator<T>{
        public int compare(T x, T y){
            return (x.compareTo(y) >= 0) ? 1 : -1;
        }
    }
    int mul(int x, int y){
        int val = (int)((x * 1L * y) % mod);
        return val>=0 ? val : val+mod;
    }
    int add(int x, int y) {
        x += y;
        if(x < 0) x += mod;
        if(x>=mod) x -= mod;
        return x;
    }
    int sub(int x, int y){
        x = add(x,mod-y);
        if(x < 0) x += mod;
        if(x>=mod) x -= mod;
        return x;
    }
    String ns() throws IOException {
        while (!tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine(), " ");
        }
        return tok.nextToken();
    }
 
    int ni() throws IOException {
        return Integer.parseInt(ns());
    }
 
    long nl() throws IOException {
        return Long.parseLong(ns());
    }
 
    double nd() throws IOException {
        return Double.parseDouble(ns());
    }
 
    String[] nsa(int n) throws IOException {
        String[] res = new String[n];
        for (int i = 0; i < n; i++) {
            res[i] = ns();
        }
        return res;
    }
 
    int[] nia(int n) throws IOException {
        int[] res = new int[n];
        for (int i = 0; i < n; i++) {
            res[i] = ni();
        }
        return res;
    }
 
    long[] nla(int n) throws IOException {
        long[] res = new long[n];
        for (int i = 0; i < n; i++) {
            res[i] = nl();
        }
        return res;
    }
 
    static BufferedReader in;
    static PrintWriter out;
    static StringTokenizer tok;
 
    public static void main(String[] args) throws IOException {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        tok = new StringTokenizer("");
        Main main = new Main();
        main.solve();
        out.close();
    }
}

Measured memory_bytes: 57232