#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
 
int main() {
	int n, m, a[105], b, c[105]={0}, it;
	long long int s=0, d[105]={0};
	scanf("%d%d", &n, &m);
	for(int i=0; i<n; i++) scanf("%d", &a[i]), d[i]=a[i];
	for(int i=0; i<m; i++) scanf("%d", &b), c[b-1]++;
	for(int i=0; i<n; i++) if(c[i]==0) s+=a[i];
	sort(d, d+n);
	it=n-1;
	for(int i=0; i<n; i++) if(c[i]) s+=max(s, d[it]), it--;
	printf("%lld\n", s);
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y3N0ZGlvPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CglpbnQgbiwgbSwgYVsxMDVdLCBiLCBjWzEwNV09ezB9LCBpdDsKCWxvbmcgbG9uZyBpbnQgcz0wLCBkWzEwNV09ezB9OwoJc2NhbmYoIiVkJWQiLCAmbiwgJm0pOwoJZm9yKGludCBpPTA7IGk8bjsgaSsrKSBzY2FuZigiJWQiLCAmYVtpXSksIGRbaV09YVtpXTsKCWZvcihpbnQgaT0wOyBpPG07IGkrKykgc2NhbmYoIiVkIiwgJmIpLCBjW2ItMV0rKzsKCWZvcihpbnQgaT0wOyBpPG47IGkrKykgaWYoY1tpXT09MCkgcys9YVtpXTsKCXNvcnQoZCwgZCtuKTsKCWl0PW4tMTsKCWZvcihpbnQgaT0wOyBpPG47IGkrKykgaWYoY1tpXSkgcys9bWF4KHMsIGRbaXRdKSwgaXQtLTsKCXByaW50ZigiJWxsZFxuIiwgcyk7CglyZXR1cm4gMDsKfQ==

MiAyCjEwMCAyMDAKMSAy

2 2
100 200
1 2