#include <iostream>
#include <unordered_map>
#include <string>
using namespace std;

void find_most_frequent_ngram(const string& S, int N) {
    unordered_map<string, int> a;
    int w = 0;
    string d;

    for (int i = 0; i <= S.length() - N; ++i) {
        string ngram = S.substr(i, N);
        a[ngram]++;
        if (a[ngram] > w) {
            w = a[ngram];
            d = ngram;
        }
    }
        cout << d << " " << w << endl;
}

int main() {
    string input, S;
    int N;
    getline(cin, input);
    size_t space_pos = input.find_last_of(' ');
    S = input.substr(0, space_pos);
    N = stoi(input.substr(space_pos + 1));
    find_most_frequent_ngram(S, N);
    
    return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;

int main() {
    fastio;

    int t = 1; 
    while (t--) {
        int n;
        cin >> n;

        vector<int> v(n);
        rep(i, n) cin >> v[i];

        vector<int> sum(n + 1, 0);
        for (int i = 0; i < n; ++i) {
            sum[i + 1] = sum[i] + v[i];
        }

        int maximum = 0;
        for (int i = 1; i <= n; ++i) {
            maximum = max(maximum, (sum[i] + i - 1) / i);
        }

      

        int q;
        cin >> q;

        rep(i, q) {
            int x;
            cin >> x;
            if (x < maximum) {
                cout << -1 << endl;
            } else {
                cout << (sum[n] + x - 1) / x << endl;
            }
        }
    }

    return 0;
}

def valueOfExpression(n):
    if n <= 1:
        return 0
    count = 0
    d = 2
    while d * d <= n:
        if n % d == 0:
            count += 1
            while n % d == 0:
                n //= d
        d += 1
    if n > 1:
        count += 1
    return count

def fun(arr):
    maxFactors = 0
    result = 0
    for num in arr:
        factors = valueOfExpression(num)
        if factors > maxFactors or (factors == maxFactors and num > result):
            maxFactors = factors
            result = num
    return result

def solve(x, n, a):
    result = float('inf')
    for i in range(n - x + 1):
        result = min(result, fun(a[i:i+x]))
    return result