#include <iostream>

#include <cstring>

#include <cstdio>

#include <stack>

using namespace std;

const int M = 1e5 + ;

typedef long long ll;

ll Stack[M][];

int main() {

    int n , k , m , x , top = ;

    ll ans = ;

    cin >> n >> k >> m;

    for(int i =  ; i < n ; i++) {

        cin >> x;

        if(!top || Stack[top][] != x) {

            Stack[++top][] = x;

            Stack[top][] = ;

        }

        else {

            Stack[top][]++;

        }

        if(Stack[top][] == k) {

            Stack[top--][] -= k;

        }

    }

    ll sum = ;

    for(int i =  ; i <= top ; i++) {

        sum += Stack[i][];

    }

    int sta =  , ed = top;

    while(sta < ed && Stack[sta][] == Stack[ed][]) {

        if((Stack[sta][] + Stack[ed][]) % k == ) {

            sta++ , ed--;

        }

        else {

            Stack[sta][] = (Stack[sta][] + Stack[ed][]) % k;

            Stack[ed][] = ;

            break;

        }

    }

    if(sta < ed) {

        for(int i = sta ; i <= ed ; i++) ans += Stack[i][];

        ans *= (m - );

        ans += sum;

    }

    else if(sta == ed) {

        if(Stack[sta][] * m % k == ) ans = ;

        else {

            ans = sum + Stack[sta][] * (m - );

            ans -= Stack[sta][] * m - Stack[sta][] * m % k;

        }

    }

    cout << ans << endl;

    return ;

}