You are given a long decimal number a consisting of n digits from 1 to 9. You also have a function f that maps every digit from 1 to 9 to some (possibly the same) digit from 1 to 9.

You can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in a, and replace each digit x from this segment with f(x). For example, if a = 1337, f(1) = 1, f(3) = 5, f(7) = 3, and you choose the segment consisting of three rightmost digits, you get 1553 as the result.

What is the maximum possible number you can obtain applying this operation no more than once?

Input

The first line contains one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of digits in a.

The second line contains a string of n characters, denoting the number a. Each character is a decimal digit from 1 to 9.

The third line contains exactly 9 integers f(1), f(2), ..., f(9) (1 ≤ f(i) ≤ 9).

Output

Print the maximum number you can get after applying the operation described in the statement no more than once.

Examples

Input


4
1337
1 2 5 4 6 6 3 1 9


Output


1557


Input


5
11111
9 8 7 6 5 4 3 2 1


Output


99999


Input


2
33
1 1 1 1 1 1 1 1 1


Output


33
import java.io.*;
import java.util.*;

public class gg {
    FastScanner in;
    PrintWriter out;
    boolean systemIO = true;
    Integer INF = Integer.MAX_VALUE / 2;


    void solve() {
        int n = in.nextInt();
        String a = in.next();
        int arr[] = new int[10];
        for (int i = 0; i < 9; i++) {
            arr[i] = in.nextInt();
        }
        String max = "";
        boolean b = true, t = false;
        int id = 0;
        for (int i = 0; i < n; i++) {
            if (a.charAt(i) - 48 < arr[a.charAt(i) - 49]) {
                t = true;
                id = i;
                break;
            }
        }
        if (!t) {
            out.println(a);
            out.close();
            System.exit(0);
        }
        for (int i = 0; i < id; i++) {
            out.print(a.charAt(i));
        }
        for (int i = id; i < n; i++, id++) {
            if (b && a.charAt(i) - 48 <= arr[a.charAt(i) - 49]) {
                out.print(arr[a.charAt(i) - 49]);
            } else {
                out.print(a.charAt(i));
                b = false;
                break;
            }
        }
        for (int i = id + 1; i < n; i++) {
            out.print(a.charAt(i));
        }


    }


    private void run() throws IOException {
        if (systemIO) {
            in = new gg.FastScanner(System.in);
            out = new PrintWriter(System.out);
        } else {
            in = new gg.FastScanner(new File("h.in"));
            out = new PrintWriter(new File("h.out"));
        }
        solve();

        out.close();
    }

    class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        FastScanner(File f) {
            try {
                br = new BufferedReader(new FileReader(f));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }

        FastScanner(InputStream f) {
            br = new BufferedReader(new InputStreamReader(f));
        }

        String nextLine() {
            try {
                return br.readLine();
            } catch (IOException e) {
                return null;
            }
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

    }

    public static void main(String[] arg) throws IOException {
        new gg().run();
    }

}