TO BE CODED IN C$++$

Mitsuha is traveling to Tokyo to meet Taki Tachibana. She plans to prepare

Itomori's best sushi for him, which requires three main ingredients: Bread $(B),$ Salmon

$(S),$ and Corn $(C).$ She expresses her favourite recipe as a string, such as $"$BBSCS$",$

meaning Bread, Bread, Salmon, Corn, and Salmon.

Mitsuha has $n_b$ pieces of bread, $n_s$ pieces of salmon, and $n_c$ pieces of corn in her kitchen.

The nearby shop offers all three ingredients $($unlimited supply$)$ at prices $p_b$ yen for bread,

$p_s$ yen for salmon, and $p_c$ yen for corn.

With $r$ yen to spend, what is the maximum number of sushi plates she can prepare,

assuming she cannot break or slice any ingredients?

Input:

Recipe: a string containing only letters $B,S,C$ such that len$($string$)100$

$1n_b,n_s,n_{c}100$

$1p_b,p_s,p_{c}100$

$1r{10}^{12}$

Example $1$:

Recipe: BBBSSC

$n_{-}b=6,n_{-}s=4,n_{-}c=1$

$p_{-}b=1,p_{-}s=2,p_{-}c=3$

$r=4$

Output: $2$