A and B and Interesting Substrings

传送门

题目：

A 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 xa, xb, ..., xz ( - 105 ≤ xi ≤ 105) — the value assigned to letters a, b, c, ..., z respectively.

The second line contains string s of length between 1 and 105 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

Copy

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

Copy

2

input

Copy

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

Copy

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.

题意：给你每个小写字母的值，让你寻找所有的子串中，首尾相同且除去首尾后的字母合为0；

思路：对于一个满足条件的子串，维护一个前缀合sum数组后，对于一个子串以  i  为首字母下标，以 j 为末尾字母，如果满足条件，则有x[i]==x[j]&&sum[j-1]==sum[i]；那统计每个小写字母的前缀合个数，在不只一次出现的字母中对答案的贡献就是前一个字母相同的前缀合个数，最后由于数据较大，需要对每一个前缀合离散处理；

AC代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<map>
#include<iostream>
#include<queue>
#include<math.h>
#include<stdlib.h>
using namespace std;
const int maxn=1e5+5;
int va[30];
long long dp[maxn];
char x[maxn];
map<long long,int> m;
vector<int> v[30];
int num[30][maxn];
int main( )
{
    for(int a=0;a<26;a++)
        scanf("%d",&va[a]);
    memset(num,0,sizeof(num));
    scanf("%s",x);
    int len=strlen(x);
    dp[0]=va[x[0]-'a'];
    int top=0;
    if(m[dp[0]-'a']==0)
        m[dp[0]]=++top;
    num[x[0]-'a'][m[dp[0]]]++;
    long long ans=0;
    for(int a=1;a<len;a++){
        dp[a]=dp[a-1]+va[x[a]-'a'];
        ans+=num[x[a]-'a'][m[dp[a-1]]];
        if(m[dp[a]]==0)
            m[dp[a]]=++top;
            num[x[a]-'a'][m[dp[a]]]++;
    }
    printf("%lld\n",ans);
}