#include <bits/stdc++.h>
#include <unistd.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
 
 
typedef long long ll;
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.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 (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
//const ll MOD = 1000000007;
const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'


int solve(string s) {
  int n = s.size();
  int cnt = 0;
  rep1 (i, n - 1) {
    if (s[i] == s[i - 1])  {
      cnt++;
      s[i] = '?';
    }
  }
  return cnt;
}
 
int main() {
  fio();
  string s;
  cin >> s;
  ll k;
  cin >> k;
 
  if (s.size() == 1) {
    cout << k / 2 << endl;
    return 0;
  }
 
  if (k <= 10) {
    string t;
    rep (i, k) t += s;
    cout << solve(t) << endl;
    return 0;
  }
 
  if (s[0] != s[s.size() - 1]) {
    ll a1 = solve(s);
    cout << a1 * k << endl;
    return 0;
  }
  
  ll a1 = solve(s);
  string t2 = s;
  t2[0] = '-';
  ll a2 = solve(t2);
  string t3 = s;
  t3[s.size() - 1] = '-';
  ll a3 = solve(t3);
 
   ll ans = a1 + (min(a2, a3) + 1) * (k - 1);

   string t4 = s;
   t4[0] = '-';
   t4[s.size() - 1] = '-';
   t4 += s;
   ll ans2 = 0;
   if (k % 2 == 1) {
     ans2 += a1;
   }
   ans2 += (solve(t4) + 2) * (k / 2);
   ans = min(ans, ans2);
   
  cout << ans << endl;
}
/*
int n;
string get_bit(ll x) {
  ll mask = 1LL << (n - 1);
  string res;
  while (mask > 0) {
    if (x & mask) res += '1';
    else res += '0';
    mask >>= 1;
  }
  return res;
}

int main() {
  cin >> n;
  //string x;
  //cin >> x;

  rep (i, 1 << n) {
    DEBUG(i);
    int start = i;
    int now = start;
    do {
      string bit = get_bit(now);
      DEBUG(bit);
      if (now % 2 == 0) {
        now = now / 2 + (1 << (n - 1));
      }
      else {
        now = now / 2;
      }
    } while (now != start);
  }

}
//*/


Measured memory_bytes: 256