#include <bits/stdc++.h>
using namespace std;
int main() {
string rec;
int n;
cin >> rec >> n;
vector<int>kmp(rec.size());
kmp[0] = 0;
for(int i = 1; i < rec.size(); i++) {
int k = kmp[i - 1];
while(true) {
if(rec[i] == rec[k]) {
kmp[i] = k + 1;
break;
}
else if(k == 0) {
kmp[i] = 0;
break;
}
else k = kmp[k - 1];
}
}
int ps = kmp[rec.size() - 1];
cout << ps + n * (rec.size() - ps) << endl;
return 0;
}