// dfmt off
T lread(T=long)(){return readln.chomp.to!T;}T[] lreads(T=long)(long n){return iota(n).map!((_)=>lread!T).array;}
T[] aryread(T=long)(){return readln.split.to!(T[]);}void arywrite(T)(T a){a.map!text.join(' ').writeln;}
void scan(L...)(ref L A){auto l=readln.split;foreach(i,T;L){A[i]=l[i].to!T;}}alias sread=()=>readln.chomp();
void dprint(L...)(lazy L A){debug{auto l=new string[](L.length);static foreach(i,a;A)l[i]=a.text;arywrite(l);}}
static immutable MOD=10^^9+7;alias PQueue(T,alias l="b<a")=BinaryHeap!(Array!T,l);import std;
// dfmt on

void main()
{
    auto S = sread();
    long K = lread();
    long a;
    long i;
    if (S.length == 1)
    {
        writeln(K / 2);
        return;
    }
    while (i < S.length)
    {
        long len;
        while (i + len < S.length && S[i + len] == S[i])
            len++;
        a += len / 2;
        i += len;
    }
    long lf;
    long lb;
    while (lf < S.length && S[lf] == S[0])
        lf++;
    while (lb < S.length && S[S.length - lb - 1] == S[0])
        lb++;
    if (lf == lb)
    {
        writeln((S.length *K)/2);
        return;
    }
    if (S[0] == S[$ - 1])
    {
        writeln(a * K - lf / 2 * (K - 1) - lb / 2 * (K - 1) + (lf + lb) / 2 * (K - 1));
    }
    else
    {
        writeln(a * K);
    }
    dprint(a, lf, lb);
}
