시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
2 초 512 MB 0 0 0 0.000%

## 문제

After you’ve walked and received your degree (and moved your tassel), it’s finally time to go and raid — pardon, visit — the department receptions. Unfortunately, you only have limited time to do so, because you have an appointment to meet your parents and friends for a photo shoot. So your goal is to eat as much good food as possible in the limited time. The emphasis is on “good;” it is well known that food quality varies between different departments,4 so you want to choose carefully which receptions you attend.

There are a few snags to watch out for: (1) some receptions do access control, and won’t let you in unless you have some kind of access (like being a student in their department, or being friends with one of the staff members); (2) there are places with larger crowds, which slow you down; and (3) if you don’t eat enough, you might just drop from being famished before you reach the truly delicious food. Write a program to compute the maximum total food points you can consume.

Campus will be represented as a rectangular map. In any one step, you can move one square up, down, left, or right (but not diagonally). Each step you take burns one unit of energy, and each unit of food you consume restores one unit of energy. Consuming a unit of food requires you to stay in a food spot for one unit of time. In addition to your start and finish square (which will be marked by ‘S’ and ‘T’ on the map), there are the following types of squares:

• Move squares, denoted by ‘.’, ‘:’, ‘;’, and ‘#’. There’s no food or access control. Stepping onto such a square takes time: one unit for ‘.’, two units for ‘:’, three units for ‘;’, and four units for ‘#’. Think of ‘.’ as an empty walkway and ‘#’ as the huge crowds around Tommy Trojan or the chocolate fountain.
• Access controlled squares, denoted by capital letters A–H. These are locations where some department has set up a checkpoint to keep greedy students away from their food. You can only enter such a square if you have that privilege — you will be given the list of all your privileges as part of the input. Entering an access controlled square takes one unit of time. By the way, so does entering the start or finish square.
• Food squares, denoted by digits 1–5. Entering a food square takes one unit of time. Then, with each time step you wait (i.e., don’t move), you gain one unit of energy and the given number of food points.

Your goal is to start at ‘S’, arrive at ‘T’ by a given time, never have your energy drop to 0 or below (including in the final step when you arrive at ‘T’), and maximize the total number of food points you got along the way.

4How come EE always has much better food than CS?

## 입력

The first line is the number 1 ≤ K ≤ 100 of input data sets, followed by the K data sets, each of the following form:

The first line of the data set contain four integers h, w, e, t with 1 ≤ h, w ≤ 30, 1 ≤ e, t ≤ 100 and one string of up to 8 distinct upper-case letters from A–H. h and w are the height and width of the map, e is your initial energy level, and t is the number of time steps until you meet your parents and friends. The string (which might be empty) describes your access privileges.

This is followed by h lines of exactly w characters each. Each character is exactly one of those described above (letters ‘A’–‘H’, ‘S’, ‘T’, digits 1–5, ‘.’, ‘:’, ‘;’, ‘#’). There will be exactly one ‘S’ and exactly one ‘T’ in the map.

## 출력

For each data set, output “Data Set x:” on a line by itself, where x is its number. Then output the maximum total number of food points you can gain and arrive at the meeting point at time t or earlier. If it is impossible for you to arrive at the meeting point at time t or earlier, output “Impossible” instead.

Each data set should be followed by a blank line.

## 예제 입력 1

1
1D.ST.1.....##5
;A..........##.
;A...........#.
;A.....BBBBB;;;
;E.....B4...;.;
3E....2B.......
.......B.......
3.....;;.......


## 예제 출력 1

Data Set 1:
40



## 힌트

You start out really hungry (energy: 4), so all you can manage with your initial energy level is to make it to the bad food in the top left corner. You now need to eat enough to make it somewhere else. Unfortunately, because of the access control letters ‘B’ and the really slow squares in the top right, you cannot make it to the locations of quality 4 and 5 in time to make your meeting at time 37. So you eat the minimum amount of food to make it to the level 3 food on the left, almost at the bottom. Instead of going straight down (which would be slow), you go one square to the right, using your access privileges for ‘D’, ‘A’, and ‘E’ along the way. You eat level-3 food for as long as you can (and enough to safely make it to the meeting spot), then leave to make it to the meeting location in time. Overall, you will spend 7 units of time eating bad food (because that’s how much energy you need to make it to level-3 food), and 11 units of time eating level-3 food, for a total of 7 + 3 · 11 = 40 food points.

Instead of initially heading to the top-left corner, you could have gone to the level-1 food in the top middle. But even if you eat there, because of the ‘B’ access control and the slow squares in the top right, you won’t be able to eat enough level-4 or level-5 food to do better, and heading for level-2 food (which you could do) will give you fewer food points as well.