using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    static long[] LList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => long.Parse(ReadLine())).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var a = NList;
        var q = NN;
        var query = LList(q);
        var ans = Remainder(n, a, q, query);
        WriteLine(string.Join("\n", ans));
    }
    static long[] Remainder(int n, int[] a, int q, long[] query)
    {
        var list = new List<long> { 0 };
        var count = new int[n];
        ++count[0];
        var loopstart = 0;
        var looplen = 0;
        var loopsum = 0L;
        while (true)
        {
            list.Add(list[^1] + a[(int)(list[^1] % n)]);
            var cur = (int)(list[^1] % n);
            if (count[cur] == 1)
            {
                for (var i = 0; i < list.Count; ++i)
                {
                    if (list[i] % n == cur)
                    {
                        loopstart = i;
                        looplen = list.Count - i - 1;
                        loopsum = list[^1] - list[i];
                        break;
                    }
                }
                break;
            }
            else ++count[cur];
        }
        var ans = new long[q];
        for (var i = 0; i < q; ++i)
        {
            var k = query[i];
            if (k < list.Count) ans[i] = list[(int)k];
            else ans[i] = list[(int)((k - loopstart) % looplen) + loopstart] + loopsum * ((k - loopstart) / looplen);
        }
        return ans;
    }
}