import java.util.*; import java.io.*; import java.math.*; public class Main{ //Don't have to see. start------------------------------------------ static class InputIterator{ ArrayList inputLine = new ArrayList<>(1024); int index = 0; int max; String read; InputIterator(){ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); try{ while((read = br.readLine()) != null){ inputLine.addAll(Arrays.asList(read.split(" "))); } }catch(IOException e){} max = inputLine.size(); } boolean hasNext(){return (index < max);} String next(){ if(hasNext()){ return inputLine.get(index++); }else{ throw new IndexOutOfBoundsException("There is no more input"); } } } static HashMap CONVSTR = new HashMap<>(); static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem. static PrintWriter out = new PrintWriter(System.out); static void flush(){out.flush();} static void myout(Object t){out.println(t);} static void myerr(Object t){System.err.print("debug:");System.err.println(t);} static String next(){return ii.next();} static boolean hasNext(){return ii.hasNext();} static int nextInt(){return Integer.parseInt(next());} static long nextLong(){return Long.parseLong(next());} static double nextDouble(){return Double.parseDouble(next());} static ArrayList nextCharArray(){return myconv(next(), 0);} static ArrayList nextStrArray(int size){ ArrayList ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(next()); } return ret; } static ArrayList nextIntArray(int size){ ArrayList ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Integer.parseInt(next())); } return ret; } static ArrayList nextLongArray(int size){ ArrayList ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Long.parseLong(next())); } return ret; } @SuppressWarnings("unchecked") static String myconv(Object list, int no){//only join String joinString = CONVSTR.get(no); if(list instanceof String[]){ return String.join(joinString, (String[])list); }else if(list instanceof ArrayList){ return String.join(joinString, (ArrayList)list); }else{ throw new ClassCastException("Don't join"); } } static ArrayList myconv(String str, int no){//only split String splitString = CONVSTR.get(no); return new ArrayList(Arrays.asList(str.split(splitString))); } public static void main(String[] args){ CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, ""); solve();flush(); } //Don't have to see. end------------------------------------------ static void solve(){//Here is the main function int N = nextInt(); int K = nextInt(); ArrayList list = nextIntArray(N); long output = 0; int mod = 0; for(int i = 0; i < N; i++){ mod += list.get(i); } Collections.reverse(list); for(int i = 0; i < N; i++){ output += list.get(i) * originPow(K, i, mod); output %= mod; } myout(output); } //Method addition frame start static long originPow(long x, long n) {return originPow(x,n,-1);} static long originPow(long x, long n, long m) { long ans = 1; while (n > 0) { if ((n & 1) == 1){ ans = ans * x; if(m != -1){ans %= m;} } x = x * x; if(m != -1){x %= m;} n >>= 1; } return ans; } //Method addition frame end }