import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String S = sc.next();
        long K = sc.nextLong();

        System.out.println(solve(S, K));
    }

    public static int solve(String S, long K){
        long next = 5_000_000_000_000_000L;

        long count = 0;
        for (int i=0; i<S.length(); i++) {
            int t = S.charAt(i) - '0';

            count += Math.pow(t, next);

            if (K <= count) return t;
        }

        return -1;
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz