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;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a < b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a > b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T, class U>
inline void print(T first, U second) {
  printsp(first);
  println(second);
}
template <class T, class U, class V>
inline void print(T first, U second, V z) {
  printsp(first);
  printsp(second);
  println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a * a % m)
    if (!b & 1) ans = 1LL * ans * a % m;
  return ans;
}
pair<int, int> p[111111];
int a[111111];
int main() {
  int n, k, m;
  gn(n, k, m);
  for (int i = 0; i < n; i++) gn(a[i]);
  int nn = 0;
  for (int i = 0, j = 0; i < n; i = j) {
    for (j = i; a[i] == a[j] and j < n; j++)
      ;
    if (nn && p[nn - 1].first == p[i].first)
      p[nn - 1].second += j - i;
    else
      p[nn++] = pair<int, int>(a[i], j - i);
    p[nn - 1].second %= k;
    if (!p[nn - 1].second) nn--;
  }
  int st = 0, ed = nn - 1;
  while (st < ed) {
    if (p[st].first != p[ed].first or (p[st].second + p[ed].second) % k)
      break;
    else
      st++, ed--;
  }
  long long tot = 0;
  for (int i = 0; i < nn; i++) tot += p[i].second;
  if (m == 1) {
    cout << tot << endl;
    return 0;
  }
  long long ans = 0;
  if (st == ed) {
    ans = (long long)p[st].second * m % k;
    if (ans) {
      ans += tot - p[st].second;
      print(ans);
    } else
      puts("0");
  } else if (st < ed) {
    for (int i = st; i <= ed; i++) ans += (long long)p[i].second % k;
    long long tp = ans;
    ans *= m;
    if (p[st].first == p[ed].first) {
      ans -= (long long)(p[st].second + p[ed].second) / k * k * (m - 1);
    }
    ans += tot - tp;
    print(ans);
  } else
    puts("0");
}
