#include <bits/stdc++.h>
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>;
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
std::string pad(int num) {
  char buffer[4];
  std::snprintf(buffer, sizeof(buffer), "%03d", num);
  return buffer;
}
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>
inline T sign(T x) {
  return T(x > 0) - T(x < 0);
}
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>
inline ostream& operator<<(ostream& os, const vector<T>& v) {
  for (auto el : v) cout << el << " ";
  return os;
}
template <typename T>
inline T fetch() {
  T ret;
  cin >> ret;
  return ret;
}
template <typename T>
inline vector<T> fetch_vec(int sz) {
  vector<T> ret(sz);
  for (auto& elem : ret) cin >> elem;
  return ret;
}
ll solve() {
  string recipie;
  cin >> recipie;
  vector<ll> n = fetch_vec<ll>(3);
  vector<ll> p = fetch_vec<ll>(3);
  ll money;
  cin >> money;
  vector<ll> req(3);
  for (char c : recipie) {
    if (c == 'B')
      req[0]++;
    else if (c == 'S')
      req[1]++;
    else
      req[2]++;
  }
  ll minDone = 0;
  ll maxDone = *max_element(n.begin(), n.end()) + money;
  while (minDone <= maxDone) {
    ll guess = (minDone + maxDone) / 2;
    ll price =
        guess * req[0] * p[0] + guess * req[1] * p[1] + guess * req[2] * p[2];
    for (int i = 0; i < 3; ++i) {
      if (req[i] > 0) price -= min(n[i], guess * req[i]) * p[i];
    }
    if (price == money)
      return guess;
    else if (price < money)
      minDone = guess + 1;
    else
      maxDone = guess - 1;
  }
  return minDone - 1;
}
int main() {
  cout << solve() << endl;
  return 0;
}
