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

#include <bits/stdc++.h>
using namespace std;
namespace mine {
long long qread() {
  long long ans = 0, f = 1;
  char c = getchar();
  while (c < '0' or c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while ('0' <= c and c <= '9') ans = ans * 10 + c - '0', c = getchar();
  return ans * f;
}
void write(long long num) {
  if (num < 0) putchar('-'), num = -num;
  if (num >= 10) write(num / 10);
  putchar('0' + num % 10);
}
void write1(long long num) {
  write(num);
  putchar(' ');
}
void write2(long long num) {
  write(num);
  putchar('\n');
}
template <typename T>
void chmax(T &x, const T y) {
  x = (x > y ? x : y);
}
template <typename T>
void chmin(T &x, const T y) {
  x = (x < y ? x : y);
}
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
const int INF = 0x3f3f3f3f;
int MOD = 924844033;
inline int mm(const int x) { return x >= MOD ? x - MOD : x; }
template <typename T>
inline void add(T &x, const T y) {
  x = mm(x + y);
}
inline long long qpower(long long x, long long e) {
  long long ans = 1;
  if (e < 0) puts("error");
  while (e) {
    if (e & 1) ans = ans * x % MOD;
    x = x * x % MOD;
    e >>= 1;
  }
  return ans;
}
long long invm(long long x) { return qpower(x, MOD - 2); }
const int N = 3e5 + 10;
int a[N];
pair<int, int> b[N];
int pushin[N];
void main() {
  int n, k, m;
  scanf("%d%d%d", &n, &k, &m);
  for (int i = 1; i <= n; i++) a[i] = qread();
  b[1] = make_pair(a[1], 1);
  int cnt = 1;
  pushin[1] = 1;
  for (int i = 2; i <= n; i++) {
    if (cnt and b[cnt].first == a[i]) {
      b[cnt].second = (b[cnt].second + 1) % k;
      if (b[cnt].second == 0) cnt--;
    } else
      b[++cnt] = make_pair(a[i], 1), pushin[cnt] = i;
  }
  if (cnt == 1) {
    write(long long(b[1].second) * m % k);
    return;
  }
  pushin[cnt + 1] = n + 1;
  int fl = 1, fr = cnt;
  while (fl < fr) {
    if (b[fl].first != b[fr].first) break;
    int tt = b[fl].second + b[fr].second;
    if (tt % k == 0)
      fr--, fl++;
    else {
      b[fr].second = tt % k;
      b[fl].second = 0;
      break;
    }
  }
  if (fl > fr) {
    write(0);
    return;
  }
  if (fl == fr and 1ll * b[fl].second * m % k == 0) {
    write(0);
    return;
  }
  int left = 0;
  int sum = 0;
  for (int i = 1; i <= cnt; i++)
    if (fl <= i and i <= fr)
      sum = sum + b[i].second;
    else
      left += b[i].second;
  write2(1ll * sum * m + left);
}
};  // namespace mine
int main() {
  srand(time(0));
  mine::main();
}
