using System; using System.Collections.Generic; using System.Linq; using System.IO; using static System.Console; using static System.Convert; using static System.Math; //using static System.Globalization.CultureInfo; using System.Text; class Program { public static bool chmin(ref T num, T val) where T : IComparable { if (num.CompareTo(val) == 1) { num =val; return true; } return false; } public static bool chmax(ref T num, T val) where T : IComparable { if (num.CompareTo(val) == -1) { num = val; return true; } return false; } public static void swap(ref T v1, ref T v2) { var t = v2; v2 = v1; v1 = t; } static void Main(string[] args) { var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; Console.SetOut(sw); new Program().Solve(); Console.Out.Flush(); } void Solve() { var num = Input.num; var x = int.MaxValue; var ar = Input.ar; var pq = new PriorityQueue(list: ar); var sum = 0L; for (var i = 0; i < num; i++) sum += ar[i]; var q = Input.num; var xs = Input.ar; for(var i=0;i=x) { var p = pq.Dequeue(); sum -= p - pq.Enqueue(p % x); } WriteLine(sum); } } } public class PriorityQueue where T : IComparable { public List _item; public int Count { get { return _item.Count; } } public bool IsMaxHeap { get; set; } public T Peek { get { return _item[0]; } } public PriorityQueue(bool IsMaxHeap = true, IEnumerable list = null) { _item = new List(); this.IsMaxHeap = IsMaxHeap; if (list != null) { _item.AddRange(list); Build(); } } private int Compare(int i, int j) => (IsMaxHeap ? 1 : -1) * _item[i].CompareTo(_item[j]); private void Swap(int i, int j) { var t = _item[i]; _item[i] = _item[j]; _item[j] = t; } private int Parent(int i) => (i - 1) >> 1; private int Left(int i) => (i << 1) + 1; public T Enqueue(T val) { int i = _item.Count; _item.Add(val); while (i > 0) { int p = Parent(i); if (Compare(i, p) > 0) Swap(i, p); i = p; } return val; } private void Heapify(int index) { for (int i = index, j; (j = Left(i)) < _item.Count; i = j) { if (j != _item.Count - 1 && Compare(j, j + 1) < 0) j++; if (Compare(i, j) < 0) Swap(i, j); } } public T Dequeue() { T val = _item[0]; _item[0] = _item[_item.Count - 1]; _item.RemoveAt(_item.Count - 1); Heapify(0); return val; } private void Build() { for (var i = (_item.Count >> 1) - 1; i >= 0; i--) Heapify(i); } } public class Input { public static string read => ReadLine().Trim(); public static int[] ar => read.Split(' ').Select(int.Parse).ToArray(); public static int num => ToInt32(read); public static long[] arL => read.Split(' ').Select(long.Parse).ToArray(); public static long numL => ToInt64(read); public static T[] create(int n, Func f) => Enumerable.Repeat(0, n).Select(f).ToArray(); public static char[][] grid(int h) => create(h, _ => read.ToCharArray()); public static int[] ar1D(int n) => create(n, _ => num); public static long[] arL1D(int n) => create(n, _ => numL); public static string[] strs(int n) => create(n, _ => read); public static int[][] ar2D(int n) => create(n, _ => ar); public static long[][] arL2D(int n) => create(n, _ => arL); public static List[] edge(int n) => create(n, _ => new List()); public static T GetValue(string g) { var t = typeof(T); if (t == typeof(int)) return (T)(object)int.Parse(g); if (t == typeof(long)) return (T)(object)long.Parse(g); if (t == typeof(string)) return (T)(object)g; if (t == typeof(char)) return (T)(object)char.Parse(g); if (t == typeof(double)) return (T)(object)double.Parse(g); if (t == typeof(bool)) return (T)(object)bool.Parse(g); return default(T); } public static void Make(out T1 v1, out T2 v2) { v1 = Next(); v2 = Next(); } public static void Make(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next(); } public static void Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next(); } public static void Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next(); } public static void Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next(); } private static Queue sc; public static T Next() { sc = sc ?? new Queue(); if (sc.Count == 0) foreach (var item in read.Split(' ')) sc.Enqueue(item); return GetValue(sc.Dequeue()); } public static void Next(ref T val) => val = Next(); public const long Inf = (long)1e18; public const double eps = 1e-6; public const string Alfa = "abcdefghijklmnopqrstuvwxyz"; public const int MOD = 1000000007; } public class Pair : IComparable> { public T1 v1 { get; set; } public T2 v2 { get; set; } public Pair() { v1 = Input.Next(); v2 = Input.Next(); } public Pair(T1 v1, T2 v2) { this.v1 = v1; this.v2 = v2; } public int CompareTo(Pair p) { var c = Comparer.Default.Compare(v1, p.v1); if (c == 0) c = Comparer.Default.Compare(v2, p.v2); return c; } public override string ToString() => $"{v1.ToString()} {v2.ToString()}"; public override bool Equals(object obj) => this == (Pair)obj; public override int GetHashCode() => v1.GetHashCode() ^ v2.GetHashCode(); public static bool operator ==(Pair p1, Pair p2) => p1.CompareTo(p2) == 0; public static bool operator !=(Pair p1, Pair p2) => p1.CompareTo(p2) != 0; public static bool operator >(Pair p1, Pair p2) => p1.CompareTo(p2) == 1; public static bool operator >=(Pair p1, Pair p2) => p1.CompareTo(p2) != -1; public static bool operator <(Pair p1, Pair p2) => p1.CompareTo(p2) == -1; public static bool operator <=(Pair p1, Pair p2) => p1.CompareTo(p2) != 1; } public class Pair : Pair, IComparable> { public T3 v3 { get; set; } public Pair() : base() { v3 = Input.Next(); } public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2) { this.v3 = v3; } public int CompareTo(Pair p) { var c = base.CompareTo(p); if (c == 0) c = Comparer.Default.Compare(v3, p.v3); return c; } public override string ToString() => $"{base.ToString()} {v3.ToString()}"; }