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;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <typename...>
static inline int getchar_unlocked(void) {
  return getchar();
}
template <typename...>
static inline void putchar_unlocked(int c) {
  putchar(c);
}
void reader(int& x) {
  int k, m = 0;
  x = 0;
  for (;;) {
    (k) = getchar_unlocked();
    if (k == '-') {
      m = 1;
      break;
    }
    if ('0' <= k && k <= '9') {
      x = k - '0';
      break;
    }
  }
  for (;;) {
    (k) = getchar_unlocked();
    if (k < '0' || k > '9') break;
    x = x * 10 + k - '0';
  }
  if (m) x = -x;
}
void reader(ll& x) {
  int k, m = 0;
  x = 0;
  for (;;) {
    (k) = getchar_unlocked();
    if (k == '-') {
      m = 1;
      break;
    }
    if ('0' <= k && k <= '9') {
      x = k - '0';
      break;
    }
  }
  for (;;) {
    (k) = getchar_unlocked();
    if (k < '0' || k > '9') break;
    x = x * 10 + k - '0';
  }
  if (m) x = -x;
}
int reader(char c[]) {
  int i, s = 0;
  for (;;) {
    (i) = getchar_unlocked();
    if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF) break;
  }
  c[s++] = i;
  for (;;) {
    (i) = getchar_unlocked();
    if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break;
    c[s++] = i;
  }
  c[s] = '\0';
  return s;
}
int reader(string& c) {
  int i;
  for (;;) {
    (i) = getchar_unlocked();
    if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF) break;
  }
  c.push_back(i);
  for (;;) {
    (i) = getchar_unlocked();
    if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break;
    c.push_back(i);
  };
  return ((int)c.size());
}
template <class T, class S>
void reader(T& x, S& y) {
  reader(x);
  reader(y);
}
template <class T, class S, class U>
void reader(T& x, S& y, U& z) {
  reader(x);
  reader(y);
  reader(z);
}
template <class T, class S, class U, class V>
void reader(T& x, S& y, U& z, V& w) {
  reader(x);
  reader(y);
  reader(z);
  reader(w);
}
void writer(int x, char c) {
  int s = 0, m = 0;
  char f[10];
  if (x < 0) m = 1, x = -x;
  while (x) f[s++] = x % 10, x /= 10;
  if (!s) f[s++] = 0;
  if (m) putchar_unlocked('-');
  while (s--) putchar_unlocked(f[s] + '0');
  putchar_unlocked(c);
}
void writer(ll x, char c) {
  int s = 0, m = 0;
  char f[20];
  if (x < 0) m = 1, x = -x;
  while (x) f[s++] = x % 10, x /= 10;
  if (!s) f[s++] = 0;
  if (m) putchar_unlocked('-');
  while (s--) putchar_unlocked(f[s] + '0');
  putchar_unlocked(c);
}
void writer(const char c[]) {
  int i;
  for (i = 0; c[i] != '\0'; i++) putchar_unlocked(c[i]);
}
void writer(const string& x, char c) {
  int i;
  for (i = 0; x[i] != '\0'; i++) putchar_unlocked(x[i]);
  putchar_unlocked(c);
}
void writer(const char x[], char c) {
  int i;
  for (i = 0; x[i] != '\0'; i++) putchar_unlocked(x[i]);
  putchar_unlocked(c);
}
template <class T>
void writerLn(T x) {
  writer(x, '\n');
}
template <class T, class S>
void writerLn(T x, S y) {
  writer(x, ' ');
  writer(y, '\n');
}
template <class T, class S, class U>
void writerLn(T x, S y, U z) {
  writer(x, ' ');
  writer(y, ' ');
  writer(z, '\n');
}
template <class T>
void writerArr(T x[], int n) {
  if (!n) {
    putchar_unlocked('\n');
    return;
  }
  for (int i = 0; i < (n - 1); i++) writer(x[i], ' ');
  writer(x[n - 1], '\n');
}
template <class T>
void writerArr(vector<T>& x) {
  writerArr(x.data(), (int)x.size());
}
template <class T>
void chmin(T& a, const T& b) {
  if (a > b) a = b;
}
template <class T>
void chmax(T& a, const T& b) {
  if (a < b) a = b;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
ll mod_pow(ll a, ll n, ll mod) {
  ll ret = 1;
  ll p = a % mod;
  while (n) {
    if (n & 1) ret = ret * p % mod;
    p = p * p % mod;
    n >>= 1;
  }
  return ret;
}
template <class T>
T extgcd(T a, T b, T& x, T& y) {
  for (T u = y = 1, v = x = 0; a;) {
    T q = b / a;
    swap(x -= q * u, u);
    swap(y -= q * v, v);
    swap(b -= q * a, a);
  }
  return b;
}
template <class T>
T mod_inv(T a, T m) {
  T x, y;
  extgcd(a, m, x, y);
  return (m + x % m) % m;
}
int main() {
  int n, k, m;
  reader(n, k, m);
  vector<int> a(n);
  for (int i = 0; i < (n); i++) reader(a[i]);
  vector<Pii> q;
  for (int i = 0; i < (n); i++) {
    if (((int)q.size()) && q.back().first == a[i]) {
      q.back().second++;
    } else {
      q.emplace_back(a[i], 1);
    }
    if (((int)q.size()) && q.back().second == k) {
      q.pop_back();
    }
  }
  int l = 0, r = ((int)q.size()) - 1;
  while (l < r) {
    if (q[l].first == q[r].first) {
      int nf = q[l].first;
      int ns = q[l].second + q[r].second;
      if (ns < k) {
        break;
      } else if (ns == k) {
        l++;
        r--;
      } else {
        q[r].second -= k - q[l].first;
        q[l].first = 0;
        l++;
        break;
      }
    } else {
      break;
    }
  }
  vector<Pii> mdl;
  for (int i = l; i <= r; i++) {
    mdl.push_back(q[i]);
  }
  ll ans = 0;
  if (m == 1) {
    for (auto& kv : q) ans += kv.second;
  } else {
    if (((int)mdl.size()) == 1) {
      vector<Pii> cur;
      for (int i = 0; i < (r + 1); i++) cur.push_back(q[i]);
      int rem = ll(mdl[0].second) * (m - 2) % k;
      cur.emplace_back(mdl[0].first, rem);
      for (int i = l; i < ((int)q.size()); i++) cur.emplace_back(q[i]);
      vector<Pii> q2;
      for (auto& kv : cur) {
        if (((int)q2.size()) && q2.back().first == kv.first) {
          q2.back().second += kv.second;
        } else {
          q2.emplace_back(kv);
        }
        if (((int)q2.size()) && q2.back().second >= k) {
          q2.back().second -= k;
          if (q2.back().second == 0) {
            q2.pop_back();
          }
        }
      }
      for (auto& kv : q2) ans += kv.second;
    } else {
      for (int i = 0; i <= r; i++) ans += q[i].second;
      ll rcnt = 0;
      for (auto& kv : mdl) rcnt += kv.second;
      ans += rcnt * (m - 2);
      for (int i = l; i < n; i++) ans += q[i].second;
    }
  }
  writerLn(ans);
  return 0;
}
