A garment workshop embroiders a customer's short message onto a banner with a single automated needle, one letter at a time, left to right. Each of the 26 lowercase letters requires a fixed number of stitch-units of horizontal thread to embroider (letter 'a' has its own stitch-unit cost, letter 'b' has its own, and so on through 'z'). The embroidery hoop can hold at most 100 stitch-units of thread on any single row. Before embroidering the next letter, the machine checks whether adding that letter would push the current row's total strictly above 100 stitch-units; if so, it advances to a brand-new row and embroiders that letter there instead (starting the new row's total at that letter's own cost). Otherwise the letter is added to the current row.

Given the 26 stitch-unit costs and the message, determine how many rows the machine ends up using in total, and how many stitch-units are used on the final row.

Input format

The input consists of 27 whitespace-separated tokens. The first 26 are integers widths[0..25], where widths[i] is the stitch-unit cost of the letter at position i in the alphabet (widths[0] is 'a', widths[25] is 'z'). The 27th token is the message string s.

Output format

Print two space-separated integers: the total number of rows used, followed by the number of stitch-units used on the final row.

Constraints

• widths.length == 26, and 1 <= widths[i] <= 10 for every i.
• 1 <= s.length <= 100, and s consists only of lowercase English letters.
• A row's stitch-unit total may reach exactly 100; only a letter that would push it strictly above 100 forces a new row.

10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10
abcdefghijklmnopqrstuvwxyz

3 60

4 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10
bbbcccdddaaaa

2 8