#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#define int long long
using namespace std;
int read(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
const int N = 2e5+5;
int id,pos[N*2],sz[N*2];
char s[N];
int fa[20][N*2];
struct SAM{
	struct aa{
		int ch[26],len,fa;
	}node[N*2];
	int las=1,tot=1;
	void ins(int x){
		int p = las,np = las = ++tot;
		pos[np] = id;
		sz[np] = 1;
		node[np].len = node[p].len+1;
		for(;p&&!node[p].ch[x];p=node[p].fa){
			node[p].ch[x] = np;
		}
		if(!p){
			node[np].fa = 1;
		}else{
			int q = node[p].ch[x];
			if(node[p].len+1==node[q].len){
				node[np].fa = q;
			}else{
				int nq = ++tot;
				node[nq] = node[q];
				node[nq].len = node[p].len+1;
				node[q].fa = nq;node[np].fa = nq;
				for(;p&&node[p].ch[x]==q;p=node[p].fa){
					node[p].ch[x] = nq;
				}
			}
		}
	}
	struct cc{
		int x,y;
		bool operator<(const cc&u)const{
			return y>u.y;
		}
	};
	vector<cc>ed[N*2];
	int sum[N*2];//sum表示当前节点的最小排名，即字典序比他大的字符串的个数+1
	int num; 
	int cnt(int x){
		return node[x].len-node[node[x].fa].len;
	}
	void dfs(int u){
		for(auto x:ed[u]){
			dfs(x.x);
		}
		sum[u] = num+1;
		num+=node[u].len-node[node[u].fa].len;
	}
	int a[N*2],S[N*2];
	
	void build(){
		for(int i=1;i<=tot;i++){
			S[node[i].len]++;
		}
		for(int i=1;i<=tot;i++){
			S[i]+=S[i-1];
		}
		for(int i=1;i<=tot;i++){
			a[S[node[i].len]--] = i;
		}
		for(int i=tot;i>=1;i--){
			int u = a[i];
			sz[node[u].fa]+=sz[u];
			if(!pos[node[u].fa]){
				pos[node[u].fa] = pos[u];
			}
		}
		for(int i=tot;i>=2;i--){
			ed[node[i].fa].push_back((cc){i,s[pos[i]+node[node[i].fa].len]-'a'});
		}
		for(int i=1;i<=tot;i++){
			sort(ed[i].begin(),ed[i].end());
		} 
		num = 0;
		dfs(1);
		for(int i=1;i<=tot;i++){
			fa[0][i] = node[i].fa;
//			cout<<"I:"<<i<<" "<<node[i].fa<<" "<<node[i].len<<"\n";
		}
		for(int i=1;i<=19;i++){
			for(int j=1;j<=tot;j++){
				fa[i][j] = fa[i-1][fa[i-1][j]];
			}
		}
	}
}T;
int n,m;
int a[N],pre[N];
int pla[N];
struct xx{
	int l,r;
};
vector<xx>res;
signed main(){
	scanf("%s",s+1);
	n = strlen(s+1);
	for(int i=n;i>=1;i--){
		id = i;
		T.ins(s[i]-'a');
		pla[i] = T.las;
//		cout<<"I:"<<"LAS:"<<T.las<<"\n";
	}
	for(int i=1;i<=n;i++){
		a[i] = read();
		pre[i] = pre[i-1]+a[i];
	}
	T.build();
	for(int i=1;i<=n;i++){
		//越往上排名越大，权值越小，要找最靠上的，排名小于等于权值的 
		int u = pla[i];
		for(int j=19;j>=0;j--){
			int y = fa[j][u];
			if(y<=1){
				continue;
			}
			if(T.sum[y]<=pre[i+T.node[y].len-1]-pre[i-1]){
				u = y;
			}
		}
		int l = T.node[T.node[u].fa].len+1;int r = T.node[u].len;
		int ans = 0;
		
		while(l<=r){
			int mid = (l+r)/2;
			if(T.sum[u]+T.node[u].len-mid<=pre[i+mid-1]-pre[i-1]){
				r = mid-1;
				ans = mid;
			}else{
				l = mid+1;
			}
		}
//		cout<<"U:"<<u<<" "<<pla[i]<<" "<<ans<<" "<<T.sum[u]<<"\n";
		if(ans&&T.sum[u]+T.node[u].len-ans==pre[i+ans-1]-pre[i-1]){
			res.push_back((xx){i,i+ans-1});
		}
	}
	cout<<res.size()<<"\n";
	for(auto x:res){
		cout<<x.l<<" "<<x.r<<"\n";
	}
	return 0;
}