#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}


string ans,s = "";
void tec(string s,ll i) {
    if (i == 1) {
        ans = s;
        return;
    }
    
    i--;
    if (i % 2 == 0) tec(s+'A',i/2); 
    if (i % 3 == 0)  tec(s + 'B', i/3);  
}



int main()
{

    int Q;
    Q = 1;
    //cin >> Q;   

    while (Q--) {
        int n, t;
        cin >> n >> t;
        vector<int>r(n );
        r[0] = t;
        for (int i = 1; i < n; i++) {
            cin >> r[i];
            t -= r[i];
            r[i] = t;
        }
        deque<int>d;
        int k;
        cin >> k;
        for (int i = 0; i < k; i++) {
            int x;
            cin >> x;
            
            d.push_back(x);
        }
        if (r[n - 1] > 0) {
            cout << 0; return 0;
        }
        int a = r[n-1]/10;
        if (r[n - 1] % 10)a--;
        int w = 0;
        for (int i = 0; i < k; i++) {
            int y = d.front();
            if (r[y] + w * 10 <= 0) {
                cout << -1; return 0;
            }
            if (a) {
                w++; a++;
                
            }
            
        }
        cout << k - w;
      
    }
        return 0;
}