import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Jenish
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        to_infinity solver = new to_infinity();
        solver.solve(1, in, out);
        out.close();
    }

    static class to_infinity {
        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            String s = in.scanString();
            long n = s.length();
            long totals_sum = 0;
            long k = in.scanLong();
            long a = 5000000000000000l;
            for (int i = 0; i < n; i++) {
                long p = power(s.charAt(i) - '0', a);
                if (p <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
                totals_sum = ((totals_sum) + p);
                if (totals_sum >= k || totals_sum <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
            }
        }

        public static long power(long x, long y) {
            long res = 1;
            x = x;
            while (y > 0) {
                if ((y & 1) != 0)
                    res = (res * x);
                y = y >> 1;
                x = (x * x);
            }
            return res;
        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int INDEX;
        private BufferedInputStream in;
        private int TOTAL;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (INDEX >= TOTAL) {
                INDEX = 0;
                try {
                    TOTAL = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (TOTAL <= 0) return -1;
            }
            return buf[INDEX++];
        }

        public String scanString() {
            int c = scan();
            while (isWhiteSpace(c)) c = scan();
            StringBuilder RESULT = new StringBuilder();
            do {
                RESULT.appendCodePoint(c);
                c = scan();
            } while (!isWhiteSpace(c));
            return RESULT.toString();
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

        public long scanLong() {
            long I = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    I *= 10;
                    I += n - '0';
                    n = scan();
                }
            }
            return neg * I;
        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.io.FilterInputStream; FilterInputStream java.io import java.io.BufferedInputStream; BufferedInputStream java.io import java.io.InputStream; InputStream java.io public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        to_infinity solver = new to_infinity();
        solver.solve(1, in, out);
        out.close();
    }

    static class to_infinity {
        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            String s = in.scanString();
            long n = s.length();
            long totals_sum = 0;
            long k = in.scanLong();
            long a = 5000000000000000l;
            for (int i = 0; i < n; i++) {
                long p = power(s.charAt(i) - '0', a);
                if (p <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
                totals_sum = ((totals_sum) + p);
                if (totals_sum >= k || totals_sum <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
            }
        }

        public static long power(long x, long y) {
            long res = 1;
            x = x;
            while (y > 0) {
                if ((y & 1) != 0)
                    res = (res * x);
                y = y >> 1;
                x = (x * x);
            }
            return res;
        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int INDEX;
        private BufferedInputStream in;
        private int TOTAL;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (INDEX >= TOTAL) {
                INDEX = 0;
                try {
                    TOTAL = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (TOTAL <= 0) return -1;
            }
            return buf[INDEX++];
        }

        public String scanString() {
            int c = scan();
            while (isWhiteSpace(c)) c = scan();
            StringBuilder RESULT = new StringBuilder();
            do {
                RESULT.appendCodePoint(c);
                c = scan();
            } while (!isWhiteSpace(c));
            return RESULT.toString();
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

        public long scanLong() {
            long I = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    I *= 10;
                    I += n - '0';
                    n = scan();
                }
            }
            return neg * I;
        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        to_infinity solver = new to_infinity();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        to_infinity solver = new to_infinity();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out ScanReader in = new ScanReader(inputStream); in new ScanReader(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) to_infinity solver = new to_infinity(); solver new to_infinity() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class to_infinity {
        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            String s = in.scanString();
            long n = s.length();
            long totals_sum = 0;
            long k = in.scanLong();
            long a = 5000000000000000l;
            for (int i = 0; i < n; i++) {
                long p = power(s.charAt(i) - '0', a);
                if (p <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
                totals_sum = ((totals_sum) + p);
                if (totals_sum >= k || totals_sum <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
            }
        }

        public static long power(long x, long y) {
            long res = 1;
            x = x;
            while (y > 0) {
                if ((y & 1) != 0)
                    res = (res * x);
                y = y >> 1;
                x = (x * x);
            }
            return res;
        }

    } to_infinity public void solve(int testNumber, ScanReader in, PrintWriter out) {
            String s = in.scanString();
            long n = s.length();
            long totals_sum = 0;
            long k = in.scanLong();
            long a = 5000000000000000l;
            for (int i = 0; i < n; i++) {
                long p = power(s.charAt(i) - '0', a);
                if (p <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
                totals_sum = ((totals_sum) + p);
                if (totals_sum >= k || totals_sum <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
            }
        } solve {
            String s = in.scanString();
            long n = s.length();
            long totals_sum = 0;
            long k = in.scanLong();
            long a = 5000000000000000l;
            for (int i = 0; i < n; i++) {
                long p = power(s.charAt(i) - '0', a);
                if (p <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
                totals_sum = ((totals_sum) + p);
                if (totals_sum >= k || totals_sum <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
            }
        } String s = in.scanString(); s in.scanString() in.scanString in long n = s.length(); n s.length() s.length s long totals_sum = 0; totals_sum 0 long k = in.scanLong(); k in.scanLong() in.scanLong in long a = 5000000000000000l; a 5000000000000000l for (int i = 0; i < n; i++) {
                long p = power(s.charAt(i) - '0', a);
                if (p <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
                totals_sum = ((totals_sum) + p);
                if (totals_sum >= k || totals_sum <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                long p = power(s.charAt(i) - '0', a);
                if (p <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
                totals_sum = ((totals_sum) + p);
                if (totals_sum >= k || totals_sum <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
            } {
                long p = power(s.charAt(i) - '0', a);
                if (p <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
                totals_sum = ((totals_sum) + p);
                if (totals_sum >= k || totals_sum <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
            } long p = power(s.charAt(i) - '0', a); p power(s.charAt(i) - '0', a) power s.charAt(i) - '0' s.charAt(i) s.charAt s i '0' a if (p <= 0) {
                    out.println(s.charAt(i));
                    return;
                } p <= 0 p 0 {
                    out.println(s.charAt(i));
                    return;
                } out.println(s.charAt(i)) out.println out s.charAt(i) s.charAt s i return; totals_sum = ((totals_sum) + p) totals_sum ((totals_sum) + p) (totals_sum) p if (totals_sum >= k || totals_sum <= 0) {
                    out.println(s.charAt(i));
                    return;
                } totals_sum >= k || totals_sum <= 0 totals_sum >= k totals_sum k totals_sum <= 0 totals_sum 0 {
                    out.println(s.charAt(i));
                    return;
                } out.println(s.charAt(i)) out.println out s.charAt(i) s.charAt s i return; int testNumber testNumber ScanReader in in PrintWriter out out public static long power(long x, long y) {
            long res = 1;
            x = x;
            while (y > 0) {
                if ((y & 1) != 0)
                    res = (res * x);
                y = y >> 1;
                x = (x * x);
            }
            return res;
        } power {
            long res = 1;
            x = x;
            while (y > 0) {
                if ((y & 1) != 0)
                    res = (res * x);
                y = y >> 1;
                x = (x * x);
            }
            return res;
        } long res = 1; res 1 x = x x x while (y > 0) {
                if ((y & 1) != 0)
                    res = (res * x);
                y = y >> 1;
                x = (x * x);
            } y > 0 y 0 {
                if ((y & 1) != 0)
                    res = (res * x);
                y = y >> 1;
                x = (x * x);
            } if ((y & 1) != 0)
                    res = (res * x); (y & 1) != 0 (y & 1) y 1 0 res = (res * x) res (res * x) res x y = y >> 1 y y >> 1 y 1 x = (x * x) x (x * x) x x return res; res long x x long y y static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int INDEX;
        private BufferedInputStream in;
        private int TOTAL;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (INDEX >= TOTAL) {
                INDEX = 0;
                try {
                    TOTAL = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (TOTAL <= 0) return -1;
            }
            return buf[INDEX++];
        }

        public String scanString() {
            int c = scan();
            while (isWhiteSpace(c)) c = scan();
            StringBuilder RESULT = new StringBuilder();
            do {
                RESULT.appendCodePoint(c);
                c = scan();
            } while (!isWhiteSpace(c));
            return RESULT.toString();
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

        public long scanLong() {
            long I = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    I *= 10;
                    I += n - '0';
                    n = scan();
                }
            }
            return neg * I;
        }

    } ScanReader private byte[] buf = new byte[4 * 1024]; buf new byte[4 * 1024] 4 * 1024 4 1024 private int INDEX; INDEX private BufferedInputStream in; in private int TOTAL; TOTAL public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        } ScanReader {
            in = new BufferedInputStream(inputStream);
        } in = new BufferedInputStream(inputStream) in new BufferedInputStream(inputStream) InputStream inputStream inputStream private int scan() {
            if (INDEX >= TOTAL) {
                INDEX = 0;
                try {
                    TOTAL = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (TOTAL <= 0) return -1;
            }
            return buf[INDEX++];
        } scan {
            if (INDEX >= TOTAL) {
                INDEX = 0;
                try {
                    TOTAL = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (TOTAL <= 0) return -1;
            }
            return buf[INDEX++];
        } if (INDEX >= TOTAL) {
                INDEX = 0;
                try {
                    TOTAL = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (TOTAL <= 0) return -1;
            } INDEX >= TOTAL INDEX TOTAL {
                INDEX = 0;
                try {
                    TOTAL = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (TOTAL <= 0) return -1;
            } INDEX = 0 INDEX 0 try {
                    TOTAL = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                } catch (Exception e) {
                    e.printStackTrace();
                } Exception e {
                    e.printStackTrace();
                } e.printStackTrace() e.printStackTrace e {
                    TOTAL = in.read(buf);
                } TOTAL = in.read(buf) TOTAL in.read(buf) in.read in buf if (TOTAL <= 0) return -1; TOTAL <= 0 TOTAL 0 return -1; -1 1 return buf[INDEX++]; buf[INDEX++] buf INDEX++ INDEX public String scanString() {
            int c = scan();
            while (isWhiteSpace(c)) c = scan();
            StringBuilder RESULT = new StringBuilder();
            do {
                RESULT.appendCodePoint(c);
                c = scan();
            } while (!isWhiteSpace(c));
            return RESULT.toString();
        } scanString {
            int c = scan();
            while (isWhiteSpace(c)) c = scan();
            StringBuilder RESULT = new StringBuilder();
            do {
                RESULT.appendCodePoint(c);
                c = scan();
            } while (!isWhiteSpace(c));
            return RESULT.toString();
        } int c = scan(); c scan() scan while (isWhiteSpace(c)) c = scan(); isWhiteSpace(c) isWhiteSpace c c = scan() c scan() scan StringBuilder RESULT = new StringBuilder(); RESULT new StringBuilder() do {
                RESULT.appendCodePoint(c);
                c = scan();
            } while (!isWhiteSpace(c)); !isWhiteSpace(c) isWhiteSpace(c) isWhiteSpace c {
                RESULT.appendCodePoint(c);
                c = scan();
            } RESULT.appendCodePoint(c) RESULT.appendCodePoint RESULT c c = scan() c scan() scan return RESULT.toString(); RESULT.toString() RESULT.toString RESULT private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        } isWhiteSpace {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        } if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false; n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1 n == '\t' n == '\r' n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1 n == ' ' n ' ' n == '\n' n '\n' n == '\r' n '\r' n == '\t' n '\t' n == -1 n -1 1 return true; true return false; false int n n public long scanLong() {
            long I = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    I *= 10;
                    I += n - '0';
                    n = scan();
                }
            }
            return neg * I;
        } scanLong {
            long I = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    I *= 10;
                    I += n - '0';
                    n = scan();
                }
            }
            return neg * I;
        } long I = 0; I 0 int n = scan(); n scan() scan while (isWhiteSpace(n)) n = scan(); isWhiteSpace(n) isWhiteSpace n n = scan() n scan() scan int neg = 1; neg 1 if (n == '-') {
                neg = -1;
                n = scan();
            } n == '-' n '-' {
                neg = -1;
                n = scan();
            } neg = -1 neg -1 1 n = scan() n scan() scan while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    I *= 10;
                    I += n - '0';
                    n = scan();
                }
            } !isWhiteSpace(n) isWhiteSpace(n) isWhiteSpace n {
                if (n >= '0' && n <= '9') {
                    I *= 10;
                    I += n - '0';
                    n = scan();
                }
            } if (n >= '0' && n <= '9') {
                    I *= 10;
                    I += n - '0';
                    n = scan();
                } n >= '0' && n <= '9' n >= '0' n '0' n <= '9' n '9' {
                    I *= 10;
                    I += n - '0';
                    n = scan();
                } I *= 10 I 10 I += n - '0' I n - '0' n '0' n = scan() n scan() scan return neg * I; neg * I neg I public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        to_infinity solver = new to_infinity();
        solver.solve(1, in, out);
        out.close();
    }

    static class to_infinity {
        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            String s = in.scanString();
            long n = s.length();
            long totals_sum = 0;
            long k = in.scanLong();
            long a = 5000000000000000l;
            for (int i = 0; i < n; i++) {
                long p = power(s.charAt(i) - '0', a);
                if (p <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
                totals_sum = ((totals_sum) + p);
                if (totals_sum >= k || totals_sum <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
            }
        }

        public static long power(long x, long y) {
            long res = 1;
            x = x;
            while (y > 0) {
                if ((y & 1) != 0)
                    res = (res * x);
                y = y >> 1;
                x = (x * x);
            }
            return res;
        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int INDEX;
        private BufferedInputStream in;
        private int TOTAL;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (INDEX >= TOTAL) {
                INDEX = 0;
                try {
                    TOTAL = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (TOTAL <= 0) return -1;
            }
            return buf[INDEX++];
        }

        public String scanString() {
            int c = scan();
            while (isWhiteSpace(c)) c = scan();
            StringBuilder RESULT = new StringBuilder();
            do {
                RESULT.appendCodePoint(c);
                c = scan();
            } while (!isWhiteSpace(c));
            return RESULT.toString();
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

        public long scanLong() {
            long I = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    I *= 10;
                    I += n - '0';
                    n = scan();
                }
            }
            return neg * I;
        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        to_infinity solver = new to_infinity();
        solver.solve(1, in, out);
        out.close();
    }

    static class to_infinity {
        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            String s = in.scanString();
            long n = s.length();
            long totals_sum = 0;
            long k = in.scanLong();
            long a = 5000000000000000l;
            for (int i = 0; i < n; i++) {
                long p = power(s.charAt(i) - '0', a);
                if (p <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
                totals_sum = ((totals_sum) + p);
                if (totals_sum >= k || totals_sum <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
            }
        }

        public static long power(long x, long y) {
            long res = 1;
            x = x;
            while (y > 0) {
                if ((y & 1) != 0)
                    res = (res * x);
                y = y >> 1;
                x = (x * x);
            }
            return res;
        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int INDEX;
        private BufferedInputStream in;
        private int TOTAL;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (INDEX >= TOTAL) {
                INDEX = 0;
                try {
                    TOTAL = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (TOTAL <= 0) return -1;
            }
            return buf[INDEX++];
        }

        public String scanString() {
            int c = scan();
            while (isWhiteSpace(c)) c = scan();
            StringBuilder RESULT = new StringBuilder();
            do {
                RESULT.appendCodePoint(c);
                c = scan();
            } while (!isWhiteSpace(c));
            return RESULT.toString();
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

        public long scanLong() {
            long I = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    I *= 10;
                    I += n - '0';
                    n = scan();
                }
            }
            return neg * I;
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Jenish
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        to_infinity solver = new to_infinity();
        solver.solve(1, in, out);
        out.close();
    }

    static class to_infinity {
        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            String s = in.scanString();
            long n = s.length();
            long totals_sum = 0;
            long k = in.scanLong();
            long a = 5000000000000000l;
            for (int i = 0; i < n; i++) {
                long p = power(s.charAt(i) - '0', a);
                if (p <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
                totals_sum = ((totals_sum) + p);
                if (totals_sum >= k || totals_sum <= 0) {
                    out.println(s.charAt(i));
                    return;
                }
            }
        }

        public static long power(long x, long y) {
            long res = 1;
            x = x;
            while (y > 0) {
                if ((y & 1) != 0)
                    res = (res * x);
                y = y >> 1;
                x = (x * x);
            }
            return res;
        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int INDEX;
        private BufferedInputStream in;
        private int TOTAL;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (INDEX >= TOTAL) {
                INDEX = 0;
                try {
                    TOTAL = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (TOTAL <= 0) return -1;
            }
            return buf[INDEX++];
        }

        public String scanString() {
            int c = scan();
            while (isWhiteSpace(c)) c = scan();
            StringBuilder RESULT = new StringBuilder();
            do {
                RESULT.appendCodePoint(c);
                c = scan();
            } while (!isWhiteSpace(c));
            return RESULT.toString();
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

        public long scanLong() {
            long I = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    I *= 10;
                    I += n - '0';
                    n = scan();
                }
            }
            return neg * I;
        }

    }
}

