#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define _CRT_SECURE_NO_WARNINGS
#define fast ios::sync_with_stdio(false); cin.tie(0);
#define foru(i, k, n) for (int i = k; i < n; i++)
#define ford(i, k, n) for (int i = k; i >= n; i--)
#define ff first
#define ss second

#include <iostream>
#include <algorithm>
#include <vector>
#include <bitset>
#include <stack>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <numeric>
#include <iomanip>
#include <string>
#include <chrono>
#include <complex>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;
typedef vector<int> vi;
typedef pair<ld, ld> pld;



int main() {
    fast;
    string s;
    ll m;
    cin >> s >> m;
    int n = s.length();
    vector<int> cr(n, 1e9);
    queue<int> q;
    foru(i, 0, n) {
        if (s[i] == 'E') {
            q.push(i);
            cr[i] = 0;
        }
    }
    while (!q.empty()) {
        int pos = q.front(), amt = cr[pos]; q.pop();
        pos--;
        if (pos < 0)pos += n;
        if (cr[pos] == 1e9) {
            cr[pos] = amt + 1;
            q.push(pos);
        }
    }
    ll tot = 0;
    foru(i, 0, n) {
        tot += max(0LL, m - cr[i]);
    }
    cout << tot;
    return 0;
}