Substring【记忆化搜索】

You are given a graph with n nodes and m directed edges. One lowercase letter is assigned to each node. We define a path's value as the number of the most frequently occurring letter. For example, if letters on a path are "abaca", then the value of that path is 3. Your task is find a path whose value is the largest.

Input

The first line contains two positive integers n, m (1 ≤ n, m ≤ 300 000), denoting that the graph has n nodes and m directed edges.

The second line contains a string s with only lowercase English letters. The i-th character is the letter assigned to the i-th node.

Then m lines follow. Each line contains two integers x, y (1 ≤ x, y ≤ n), describing a directed edge from x to y. Note that x can be equal to y and there can be multiple edges between x and y. Also the graph can be not connected.

Output

Output a single line with a single integer denoting the largest value. If the value can be arbitrarily large, output -1 instead.

Examples

input

5 4
abaca
1 2
1 3
3 4
4 5

output

3

input

6 6
xzyabc
1 2
3 1
2 3
5 4
4 3
6 4

output

-1

input

10 14
xzyzyzyzqx
1 2
2 4
3 5
4 5
2 6
6 8
6 5
2 10
3 9
10 9
4 6
1 10
2 8
3 7

output

4

Note

In the first sample, the path with largest value is 1 → 3 → 4 → 5. The value is 3 because the letter 'a' appears 3 times.

思路：

定义dp[i][j]: 从i点出发的字母j的最大数量。

枚举起始点和字母。然后记忆化搜索。由于需要判环，所以需要在进行递归的时候标记dp，如果当前点已被标记，就说明有环。dp是回溯的时候进行赋值的，所以递归过程可以利用dp数组进行标记，并不会冲突。

搜索时记录从u点出发的所有路径中的c的最大值，还需要判断u点是否是c。

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<iostream>
#include<queue>
using namespace std;
#define MAXN 300005
int n,m,dp[MAXN][30];
char str[MAXN];
vector<int> G[MAXN];
int dfs(int u,int c)
{
    if(dp[u][c]==-2)
    {
        printf("-1\n");
        exit(0);
    }
    if(dp[u][c]!=-1) return dp[u][c];
    dp[u][c]=-2;
    int ret = 0;
    for(int i=0;i<G[u].size();i++)
    {
        ret=max(ret,dfs(G[u][i],c));
    }
    ret+=str[u]==c+'a';
    return dp[u][c]=ret;
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        scanf("%s",str+1);
        int u,v;
        for(int i=0;i<m;i++)
        {
            scanf("%d%d",&u,&v);
            G[u].push_back(v);
        }
        memset(dp,-1,sizeof dp);
        int ans=0;
        for(int i=1;i<=n;i++)
        {
            for(int j=0;j<26;j++)
            {
                ans=max(ans,dfs(i,j));
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}