Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. A and B and Interesting Substrings

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputA and B are preparing themselves for programming contests.

After several years of doing sports programming and solving many problems that require calculating all sorts of abstract objects, A and B also developed rather peculiar tastes.

A likes lowercase letters of the Latin alphabet. He has assigned to each letter a number that shows how much he likes that letter (he has assigned negative numbers to the letters he dislikes).

B likes substrings. He especially likes the ones that start and end with the same letter (their length must exceed one).

Also, A and B have a string *s*. Now they are trying to find out how many substrings *t* of a string *s* are interesting to B (that is, *t* starts and ends with the same letter and its length is larger than one), and also the sum of values of all letters (assigned by A), except for the first and the last one is equal to zero.

Naturally, A and B have quickly found the number of substrings *t* that are interesting to them. Can you do it?

Input

The first line contains 26 integers *x*_{a}, *x*_{b}, ..., *x*_{z} ( - 10^{5} ≤ *x*_{i} ≤ 10^{5}) — the value assigned to letters *a*, *b*, *c*, ..., *z* respectively.

The second line contains string *s* of length between 1 and 10^{5} characters, consisting of Lating lowercase letters— the string for which you need to calculate the answer.

Output

Print the answer to the problem.

Examples

Input

1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1

xabcab

Output

2

Input

1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1

aaa

Output

2

Note

In the first sample test strings satisfying the condition above are *abca* and *bcab*.

In the second sample test strings satisfying the condition above are two occurences of *aa*.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/29/2017 20:36:24 (p1).

Desktop version, switch to mobile version.
User lists

Name |
---|