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 Task {
    static int[] f;

    public static void solve(int testNumber, Scanner in, PrintWriter out) {
        int n = in.nextInt();
        StringBuilder s = new StringBuilder(in.next());
        StringBuilder ans = new StringBuilder();
        f = new int[10];
        for (int i = 1; i <= 9; ++i) f[i] = in.nextInt();
        boolean started = false, ended = false;
        for (int i = 0; i < s.length(); ++i) {
            if (!started && !ended) {
                if (f[s.charAt(i) - '0'] > s.charAt(i) - '0') {
                    started = true;
                    ans.append(f[s.charAt(i) - '0']);
                } else {
                    ans.append(s.charAt(i));
                }
            } else if (started && !ended) {
                if (f[s.charAt(i) - '0'] >= s.charAt(i) - '0') {
                    ans.append(f[s.charAt(i)-'0']);
                }else{
                    ended=true;
                    ans.append(s.charAt(i));
                }
            }else{
                ans.append(s.charAt(i));
            }
        }
        out.println(ans.toString());
    }

    public static void main(String[] args) {
        FastScanner ind = new FastScanner(System.in);
        PrintWriter out = new PrintWriter(System.out, true);
        Scanner in = new Scanner(System.in);
        solve(0, in, out);
    }
}

class Pair {
    int end, start;

    public Pair(int start, int end) {
        this.end = end;
        this.start = start;
    }
}

class FastScanner {
    BufferedReader br;
    StringTokenizer st;

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

    String next() {
        while (st == null || !st.hasMoreElements()) {
            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());
    }

    String nextLine() {
        String str = "";
        try {
            str = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return str;
    }
}
