10 5 1000000000
1 1 1 2 2 1 2 2 2 2
 5 3 3
1 2 2 1 1
 2 4 1
1 1
 1 1000000000 1000000000
100000
 5 3 2
1 1 2 1 1
 5 2 4
1 2 3 2 1
 1 10 10
1

10000000000
 0
 2
 0
 7
 0
 0

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Vector;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Queue;
import java.util.LinkedList;
import java.util.Stack;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.readInt();
            int k = in.readInt();
            int m = in.readInt();
            int[] a = in.readIntArray(n);
            Stack<Integer> redundant = new Stack<>();
            Stack<Integer> redundantCnt = new Stack<>();
            for (int i = 0; i < n; i++) {
                redundantCnt.push((redundant.isEmpty() || a[i] != redundant.peek()) ? 1 : redundantCnt.peek() + 1);
                redundant.push(a[i]);
                if (redundantCnt.peek() == k) {
                    for (int j = 0; j < k; j++) {
                        redundant.pop();
                        redundantCnt.pop();
                    }
                }
            }
            n = redundant.size();
            if (n == 0) {
                out.println(0);
                return;
            }
            if (m == 1) {
                out.println(n);
                return;
            }
            a = new int[n];
            for (int i = 0; i < n; i++) a[i] = redundant.pop();

            Stack<Integer> stack = new Stack<>();
            Queue<Integer> queue = new LinkedList<>();
            int cnt = 1, last = a[0];
            for (int i = 1; i < n; i++) {
                if (a[i] != last) {
                    stack.push(last);
                    stack.push(cnt);
                    queue.add(last);
                    queue.add(cnt);
                    cnt = 1;
                    last = a[i];
                } else {
                    cnt++;
                }
            }
            stack.push(last);
            stack.push(cnt);
            queue.add(last);
            queue.add(cnt);

            int p = 0, elems = stack.size() / 2;
            long middle = 0, left = 0, right = 0, removal = 0;
            for (int i = 0; i < elems; i++, p++) {
                int cntS = stack.pop();
                int cityS = stack.pop();
                int cityQ = queue.poll();
                int cntQ = queue.poll();
                if (i == elems / 2) middle = cntS;
                if (cityS != cityQ) break;
                if ((cntS + cntQ) % k != 0) {
                    removal = (cntS + cntQ) - ((cntS + cntQ) % k);
                    break;
                }
                left += cntS;
                right += cntQ;
            }
            if (p == elems) {
                if (m % 2 != 0) out.println(n);
                else out.println(0);
                return;
            }
            if (elems % 2 == 1 && p == elems / 2) {
                if ((m * middle) % k == 0) {
                    out.println(0);
                } else {
                    out.println(left + right + ((m * middle) % k));
                }
                return;
            }
            out.println((n * (long) m) - (left + right + removal) * (m - 1));

        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int readInt() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public int[] readIntArray(int size) {
            int[] ans = new int[size];
            for (int i = 0; i < size; i++) ans[i] = readInt();
            return ans;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}

