cf371C

C. Hamburgers

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Polycarpus loves hamburgers very much. He especially adores the hamburgers he makes with his own hands. Polycarpus thinks that there are only three decent ingredients to make hamburgers from: a bread, sausage and cheese. He writes down the recipe of his favorite "Le Hamburger de Polycarpus" as a string of letters 'B' (bread), 'S' (sausage) и 'C' (cheese). The ingredients in the recipe go from bottom to top, for example, recipe "ВSCBS" represents the hamburger where the ingredients go from bottom to top as bread, sausage, cheese, bread and sausage again.

Polycarpus has nb pieces of bread, ns pieces of sausage and nc pieces of cheese in the kitchen. Besides, the shop nearby has all three ingredients, the prices are pb rubles for a piece of bread, ps for a piece of sausage and pc for a piece of cheese.

Polycarpus has r rubles and he is ready to shop on them. What maximum number of hamburgers can he cook? You can assume that Polycarpus cannot break or slice any of the pieces of bread, sausage or cheese. Besides, the shop has an unlimited number of pieces of each ingredient.

Input

The first line of the input contains a non-empty string that describes the recipe of "Le Hamburger de Polycarpus". The length of the string doesn't exceed 100, the string contains only letters 'B' (uppercase English B), 'S' (uppercase English S) and 'C' (uppercase English C).

The second line contains three integers nb, ns, nc (1 ≤ nb, ns, nc ≤ 100) — the number of the pieces of bread, sausage and cheese on Polycarpus' kitchen. The third line contains three integers pb, ps, pc (1 ≤ pb, ps, pc ≤ 100) — the price of one piece of bread, sausage and cheese in the shop. Finally, the fourth line contains integer r (1 ≤ r ≤ 1012) — the number of rubles Polycarpus has.

Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the%I64d specifier.

Output

Print the maximum number of hamburgers Polycarpus can make. If he can't make any hamburger, print 0.

Examples

input

BBBSSC
6 4 1
1 2 3
4

output

2

input

BBC
1 10 1
1 10 1
21

output

7

input

BSC
1 1 1
1 1 3
1000000000000

output

200000000001

题意：给一个字符串表示一个“”面包“，每个”面包“由三种字符组成，每种字符数量表示构成一个”面包“需要多少个该字符。然后给出现有的三种字符材料数量，以及每种字符材料的价格。还有现在手上所有的钱的数量。问最多能制作多少”面包“。

题解：还是赤裸裸的二分，学完二分才觉得，现在真的能解决很多问题了。枚举也变得简单了很多。枚举能制作的”面包“数，最少是0，最大设定尽量大，设为1e13。然后在这里边二分，还有can（）函数，本来还能a掉这题的，结果很可惜，就是在这个can（）函数没写好。

代码：

#include <iostream>
#include <cstdio>
#include <set>
#include <queue>
#include <algorithm>
#include <fstream>
#include <map>
#include <cmath>
#include <cstring>
#define INF 1e13
using namespace std;
typedef long long ll;
typedef long long ll;
char ss[150];
ll nb,ns,nc;
ll b,s,c;
ll pb,ps,pc;
ll have;
bool can(ll a)
{
    ll sum = 0;
    if(nb&&a*nb>b)//如果不需要该材料的或者该材料已经够用了，不用加上
        sum+=(a*nb-b)*pb;
    if(ns&&a*ns>s)//同上
        sum+=(a*ns-s)*ps;
    if(nc&&a*nc>c)//同上
        sum+=(a*nc-c)*pc;
    if(sum<=have)
        return 1;
    else
        return 0;
}

int main()
{
    while (cin>>ss)
    {
        nb = ns = nc = 0;
        for (int i = 0;i < strlen(ss);i++)
        {
            if(ss[i]=='B')
                nb++;
            else if(ss[i]=='S')
                ns++;
            else
                nc++;
        }
        cin>>b>>s>>c;
        cin>>pb>>ps>>pc;
        cin>>have;
        ll lb = 0,ub = INF;
        while (ub-lb>1)
        {
            ll mid = (lb+ub)/2;
            if(can(mid))
            {
                lb = mid;
            }
            else
                ub = mid-1;
        }
        if(can(ub))
            cout<<ub<<endl;
        else
            cout<<lb<<endl;
    }
    return 0;
}

水水就过，为什么当初没想到是错在这里呢？