// author: Daniel Delchev
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <queue>
using namespace std;

struct stock{
    long long int stock_price;
    long int position;
    bool operator<(const stock& other)const{
        return stock_price < other.stock_price;
    }
};


//O(n)
long int utmost_left(vector<long int>& prices,long long int stock_price,long int& start_index,long int& end_index, long long int& sum){
    long int length = prices.size();
    while (sum < stock_price && end_index < length-1){
        sum -= prices[start_index++];
        sum += prices[++end_index];
    }
    return (sum < stock_price) ? (-1):start_index;
}


int main()
{
    int N=0;
    int K=0;
    int Q=0;
    vector <stock> stock_prices;
    vector <long int> prices;
    scanf("%i",&N);
    scanf("%i",&K);
    scanf("%i",&Q);

    prices.reserve(N);
    stock_prices.reserve(Q);
    long int buffer;
    for (int i=0;i<N;i++){
        scanf("%li",&buffer);
        prices.push_back(buffer);
    }

    long long int stock_buffer;
    stock buff;
    for (int i=0;i<Q;i++){
        scanf("%lli",&stock_buffer);
        buff.stock_price=stock_buffer;
        buff.position=i;
        stock_prices.push_back(buff);
    }
    sort(stock_prices.begin(),stock_prices.end());
    long int start_index = 0;
    long int end_index = -1;
    long long int sum = 0;
    for (int i=0;i<K;i++){
        sum += prices[++end_index];
    }
    vector <long int> result;
    result.reserve(Q);
    result.assign(Q,-100);

    for (int i=0;i<Q;i++){
        long int current = (utmost_left(prices,stock_prices[i].stock_price,start_index,end_index,sum)); //OK
        if (result[stock_prices[i].position] == current){
            result[stock_prices[i].position+1] = current;
        }
        else{
            result [stock_prices[i].position] = current;
        }
    }

    int l= result.size();
    for (int i=0;i<l;i++){
        printf("%li",result[i]);
        if (i!=l-1){
            printf("\n");
        }
    }
    return 0;
}