#include <bits/stdc++.h>
#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
#else
    #define DBG(X)
    #define SAY(X)
#endif

#ifdef __LOCAL
    #include <filesystem>
    namespace fs = std::filesystem;
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 1,-1, 1,-1};
int dy[]={0, 1, 0, -1, 1, 1,-1,-1};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
static mt19937 _g(time(nullptr));
 
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const map<T, S> p) { for (auto el : p) cout << "[" << el.first << ";" << el.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

string s;
ll k;
void input(){
    fast_io();
    #ifdef __LOCAL
        fs::path p = __FILE__;
        fs::path input,output;
        input = output = p.parent_path();
        input += string("/input/") + string(p.stem()) + string(".txt");
        output += string("/output/") + string(p.stem()) + string(".txt");
        freopen(input.c_str(), "r", stdin);
        freopen(output.c_str(), "w", stdout);
    #endif
    cin >> s >> k;
}

ll countDouble(string s){
    ll r=0;
    ll ret=0;
    for (int i = 0; i < s.length()-1; i++)
    {
        if(s[i]==s[i+1]) {r++; s[i+1]='?';}
    }
    ret = r*k;
    // if(s[0]==s[s.length()-1] && s[0]!='?') ret+=(k-1);
    DBG(ret)
    DBG(s)
    return ret;
}

ll countDoubleRev(string s){
    ll r=0;
    ll ret=0;
    for (int i = s.length()-1; i > 0 ; i--)
    {
        if(s[i]==s[i-1]) {r++; s[i-1]='?';}
    }
    ret = r*k;
    // if(s[0]==s[s.length()-1] && s[0]!='?') ret+=(k-1);
    DBG(ret)
    DBG(s)
    return ret;
}

bool isall(string s){
    for (int i = 0; i < s.length(); i++)
    {
        if(s[0]==s[i]) continue;
        else return false;
    }
    return true;    
}

int solve(){
    string t=s;
    if(s.length()==1){
        cout << k/2 << endl;
        return 0;
    }
    if(isall(s)){
        cout << (k*s.length())/2 << endl;
        return 0;
    }

    ll ans1=countDouble(s);
    ll ans2=countDoubleRev(s);
    ll ans = min(ans1,ans2);
    if(s[0]==s[s.length()-1]){
        ll a=0,b=0;
        while(s[a]==s[a+1]) a++;
        while(s[s.length()-1-b]==s[s.length()-1-b-1]) b++;
        a++;b++;
        ans += (k-1)*((a+b)/2-a/2-b/2);
    }


    // s=t;
    // s[0]='?';
    // ll ans3=countDouble(s)+(k-1);
    // ll ans4=countDoubleRev(s)+(k-1);
    // s=t;
    // s[s.length()-1]='?';
    // ll ans5=countDouble(s)+(k-1);
    // ll ans6=countDoubleRev(s)+(k-1);
    // ll ans = min({ans1,ans2});
    // ll ans = min({ans1,ans2,ans3,ans4,ans5,ans6});
    cout << ans << endl;    
    return 0;
}   

int main()
{
    input();
    solve();
    return 0;
}


Measured memory_bytes: 256