50 50
75 71 23 37 28 23 69 75 5 62 3 11 96 100 13 50 57 51 8 90 4 6 84 27 11 89 95 81 10 62 48 52 69 87 97 95 30 74 21 42 36 64 31 80 81 50 56 53 33 99
26 30 5 33 35 29 6 15 36 17 32 16 14 1 29 34 22 40 12 42 38 48 39 50 13 47 18 43 10 8 49 45 11 31 21 37 46 28 20 41 2 7 9 24 27 23 3 44 15 14
 10 10
61 59 97 16 2 94 57 48 91 93
2 8 6 5 3 1 3 4 9 10
 2 1
1 2
1
 3 3
10 20 30
1 2 3
 50 60
86 57 45 93 17 12 40 10 47 80 18 80 3 9 6 55 13 99 5 76 4 70 100 55 27 91 71 3 65 93 41 74 80 56 90 50 58 13 71 9 47 52 26 73 72 21 15 81 88 28
40 32 5 16 49 23 3 17 14 10 1 15 1 21 28 22 13 45 12 25 44 48 46 32 36 43 11 8 49 7 7 35 10 14 39 4 42 10 30 27 1 17 31 15 8 41 44 33 25 26 19 18 29 37 50 6 36 38 47 9
 2 7
20 30
1 1 1 2 2 2 2
 2 2
10 12
2 1
 5 1
16 87 36 16 81
3
 2 3
20 30
1 1 1
 2 10
39 26
1 1 2 2 2 2 2 2 1 2

63929
 2137
 0
 40
 62514
 20
 12
 0
 0
 104

import java.io.IOException;
import java.io.InputStream;
import java.util.Collections;
import java.util.InputMismatchException;
import java.util.LinkedList;


public class A {
	static int N,M;
	static int[] Q;
	public static void main(String[] args) throws Exception{
		FasterScanner sc = new FasterScanner();
		
		 N  = sc.nextInt();
		M = sc.nextInt();
		LinkedList<Book> AL = new LinkedList<Book>();
		int[] W = new int[N];
		for(int a=0;a<N;a++){
			W[a]=sc.nextInt();
			AL.add(new Book(W[a],a));
		}
//		Collections.sort(AL);
		Q = new int[M];
		for(int a=0;a<M;a++){
			Q[a] = sc.nextInt()-1;
		}
		for(int a=M-1;a>=0;a--){
			int find = Q[a];
			int i = 0;
			for(Book x : AL){
				if(x.i==find){
					break;
				}
				i++;
			}
			AL.addLast(AL.remove(i));
		}
//		for(Book x : AL){
//			System.err.print(x.i+" ");
//		}

		System.out.println(magic((LinkedList<Book>)AL.clone()));
		
		
	}
	private static long magic(LinkedList<Book> AL) {
		long total = 0;
		for(int a=0;a<M;a++){
			int find = Q[a];
			int i = 0;
			int t  = -1;
			for(Book x : AL){
				if(t!=-1){
					total+=x.w;
				}
				if(x.i==find){
					t=i;
				}
				i++;
			}
			AL.addLast(AL.remove(t));
		}
		return total;
	}
	static class Book implements Comparable<Book>{
		int w,i;
		Book(int a, int b){
			w=a;
			i=b;
		}
		@Override
		public int compareTo(Book i) {
			return -Integer.compare(this.w,i.w);
		}
	}
	
	static class DisjointSet {
		int[] p, r;

		DisjointSet(int s) {
			p = new int[s];
			r = new int[s];
			for (int i = 0; i < s; i++)
				p[i] = i;

		}
		
		void union(int x, int y) {
			int a = find(x);
			int b = find(y);
			if (a == b)
				return;
			if (r[a] == r[b])
				r[p[b] = a]++;
			else
				p[a] = p[b] = r[a] < r[b] ? b : a;
		}

		int find(int x) {
			return p[x] = p[x] == x ? x : find(p[x]);
		}

	}

	static class FasterScanner{
		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;
		
		public FasterScanner(){
			stream = System.in;
			//stream = new FileInputStream(new File("dec.in"));

		}
		int read(){
			if(numChars==-1)
				throw new InputMismatchException();
			if(curChar>=numChars){
				curChar = 0;
				try{
					numChars = stream.read(buf);
				} catch (IOException e){
					throw new InputMismatchException();
				}
				if(numChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}
		
		boolean isSpaceChar(int c){
			return c==' '||c=='\n'||c=='\r'||c=='\t'||c==-1;
		}
		boolean isEndline(int c){
			return c=='\n'||c=='\r'||c==-1;
		}
		int nextInt(){
			return Integer.parseInt(next());
		}
		long nextLong(){
			return Long.parseLong(next());
		}
		double nextDouble(){
			return Double.parseDouble(next());
		}
		String next(){
			int c = read();
			while(isSpaceChar(c))
				c=read();
			StringBuilder res = new StringBuilder();
			do{
				res.appendCodePoint(c);
				c=read();
			} while(!isSpaceChar(c));
			return res.toString();
		}
		String nextLine(){
			int c = read();
			while(isEndline(c))
				c=read();
			StringBuilder res = new StringBuilder();
			do{
				res.appendCodePoint(c);
				c = read();
			}while(!isEndline(c));
			return res.toString();
		}
		
	}
}
