#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;

void vprint(vector<ll> A){
    ll L = A.size();
    FOR(i, 0, L){
        if(i) cout << ' ';
        cout << A[i];
    }
    cout << endl;
}

char else_char(char a, char b, char c, char d){
  set<char> se;
  se.insert(a);
  se.insert(b);
  se.insert(c);
  se.insert(d);

  rep(i, 26){
    char c = 'a' + i;
    if(se.count(c)==0) return c;
  }
}

VI f(string s){
  char prev = '-';
  ll N = s.size();
  VI V;
  ll cnt = 0;
  rep(i, N){
    char c = s[i];
    if(c!=prev){
      V.push_back(cnt);
      // reset
      cnt = 1;
      prev = c;
    }else{
      cnt++;
    }
  }
  V.push_back(cnt);
  return V;
}

ll K; 
ll L;

ll get_ans(string s){
    ll n = 0;
    if(s[0]==s.back()){
    }

    debug(s);
    auto V = f(s);
    debug(V);

    if(s[0]==s.back()){
      ll a = V[1] + V.back();
      debug(a);
      FOR(i, 2, V.size()-1){
        ll v = V[i];
        if(v>1){
          n += v/2;
        }
      }
      ll ans = n*K;
      // はじっこ
      ans += (a/2)*(K-1);
      ans += V.back()/2;
      ans += V[1]/2;
      debug(ans);
      return ans;
      
    }else{
      for(ll v : V){
        if(v>1){
          n += v/2;
        }
      }
      return n*K;
    }
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    string s; cin >> s;
    L = s.size();
    cin >> K;

    if(L==1){
      p(K/2);
      return 0;
    }

    set<char> se;
    for(char c : s){
      se.insert(c);
    }
    if(se.size()==1){
      ll all_len = L * K;
      ll ans = all_len/2;
      p(ans);
      return 0;
    }

    ll ans0 = get_ans(s);
    string t = s;
    reverse(ALL(t));
    ll ans1 = get_ans(t);
    debug(ans0, ans1);

    ll mi = min(ans0, ans1);
    p(mi);
    
    return 0;
}

Measured memory_bytes: 256