codeforces

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <bitset>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <list>
#include <set>
#include <map>
#define rep(i,a,b) for(int i = a;i <= b;++ i)
#define per(i,a,b) for(int i = a;i >= b;-- i)
#define mem(a,b) memset((a),(b),sizeof((a)))
#define FIN freopen("in.txt","r",stdin)
#define FOUT freopen("out.txt","w",stdout)
#define IO ios_base::sync_with_stdio(0),cin.tie(0)
#define mid ((l+r)>>1)
#define ls (id<<1)
#define rs ((id<<1)|1)
#define N 1005
#define INF 0x3f3f3f3f
#define INFF ((1LL<<62)-1)
using namespace std;
typedef long long LL;
typedef pair<int, int> PIR;
const int mod = 1e9+7;

int n, x, lim[30], dp[N], dp1[N];
string s;

bool judge(int l, int r){
    int len = r-l;
    rep(i, l, r){
        if(lim[s[i-1]-'a'] <= len)    return false;
    }
    return true;
}
int main()
{IO;
    //FIN;
    while(cin >> n){
        cin >> s;
        rep(i, 0, 25)    { cin >> x; lim[i] = x; }

        mem(dp, 0);
        mem(dp1, INF);
        dp1[0] = 0;
        dp[0] = 1;
        int maxn = 0, minn = n;
        rep(i, 1, n){
            rep(j, 1, i){
                if(judge(j, i)){
                    dp[i] = (dp[i]%mod+dp[j-1]%mod)%mod;
                    dp1[i] = min(dp1[i], dp1[j-1]+1);
                    if(dp[j-1])
                        maxn = max(maxn, i-j+1);
                }
            }
        }
        cout << dp[n] << "
" << maxn << "
" << dp1[n] << endl;
    }
    return 0;
}