import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;

public class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        FastScanner sc = new FastScanner();
        Strategy strategy = new MyStrategy();
        strategy.solve(out, sc);
        out.flush();
    }
}

class MyStrategy implements Strategy {

    int MAX_N = 2 * 100_000;
    int[] A = new int[MAX_N  + 1];
    int[] found = new int[MAX_N  + 1];

    int find(int start, long remainig) {
//                System.out.println(start);
        if (remainig > 1) {
            return find(A[start], remainig-1);
        } else {
            return start;
        }
    }

    int[] findLoop(int start, int cnt) {
//        System.out.println(start);
        if (found[start] != -1) {
            int[] res = {found[start], cnt};
            return res;
        } else {
            found[start] = cnt;
            return findLoop(A[start], cnt + 1);
        }
    }

    @Override
    public void solve(PrintWriter out, FastScanner sc) {
        long N = sc.nextLong();
        long K = sc.nextLong();
        for (int i = 1; i <= N; i++) {
            A[i] = sc.nextInt();
            found[i] = -1;
        }

        if (K <= MAX_N) {
            out.println(find(1, K+1));
        } else {
            int[] res = findLoop(1, 0);
//            out.println("-----");
            long k = (K - (long)res[0]) % (long)(res[1] - res[0]);
//            out.println(res[0]);
//            out.println(res[1]);
//            out.println(k);
//            out.println("-----");
            int start = find(1, (long)res[0]+ 1);
//            out.println(start);
            out.println(find(start, k + 1));
        }
    }
}

interface Strategy {
    void solve(PrintWriter out, FastScanner sc);
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
}


Measured memory_bytes: 41016