There are $N$ houses $($numbered from $0$ to $N-1)$ along a street. In each of them, recyclable trash $($plastic$,$ glass, metal$)$ is collected into separate bags.

There are three trucks that collect the trash. Each of them collects a separate type of trash $($the first collects plastic, the second, glass and the third, metal$).$ All the trucks begin and end their jobs at the starting end of the street. Passing from the starting point to house number $0$ takes $D[0]$ minutes. Passing between houses number $K-1$ and $K($for $K$ in the range $1$ to $N-1)$ takes $D[K]$ minutes. Loading one bag onto the truck takes one minute.

For example, $D=[2,5]$ means that passing between the starting point and house number $0$ takes $2$ minutes and passing between houses number $0$ and $1$ takes $5$ minutes.

Each of the houses has already collected some bags $($or possibly no bags$)$ of recyclable trash. The number of bags that house number $K$ has collected is recorded in string $T[K],$ composed of letters $\text{'}P\text{'}($plastic$),\text{'}G\text{'}($glass$)$ and $\text{'}M\text{'}($metal$).$ For example, $T[1]="$GMG$"$ means that house number $1$ has collected two bags of glass and one bag of metal. Each house may collect more than one bag of each type.

All of the trucks start their jobs simultaneously. Each finishes its job after collecting all of the bags of the given type of trash and returning back to the starting point. What is the minimum number of minutes that will pass before all the trucks finish all the jobs?

Write a function:

class Solution $\{$ public int solution$($int$[]$ D$,$ String$[]$ T$)$; $\}$

that, given array $D$ of $N$ integers and array $T$ of $N$ strings, returns the minimum