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

//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")

//# include <x86intrin.h>
# include <bits/stdc++.h>

# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;
 
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
using pt = pair < int, int > ; 

int n, m, k;
int a[N];
pt st[N];
int ptr;


int main () {
   	SpeedForce;
	
	cin >> n >> k >> m;

	for (int i = 1; i <= n; ++ i) {
		cin >> a[i];
		if (!ptr || st[ptr].F != a[i]) {
			st[++ptr] = mp(a[i], 1);
		} else {
			st[ptr].second++;
		}

		if (st[ptr].S == k) {
			--ptr;
		}
	}

	ll overall = 0, res = 0, ans = 0;
	for (int i = 1; i <= ptr; ++i) overall += st[i].S;

	int l = 1, r = ptr;
	while (l < r && st[l].F == st[r].F && (st[l].S + st[r].S) % k == 0) {
		res += (st[l].S + st[r].S), l++, r--; 
	}

	if (l == r) {
		ans = overall * m - res * (m - 1);
	
		if (st[l].S * m % k == 0) ans -= res;
		ans -= (st[l].S * m / k) * k;
	} else {
		if (st[l].first == st[r].first)
			res += ((st[l].S + st[r].S) / k) * k;
		ans = overall * m - res * (m - 1);
	}
	cout << ans << '\n';




   	return Accepted;
}

// B...a