#include<bits/stdc++.h>
using namespace std;
#define int long long
char s[400005];int tp[400005],a[400005],sa[400005],rk[400005],h[400005],pre[500005],A[500005],d[500005],pred[500005],lg[1200005];
int n;
int st[200005][20];
void qsort(){
	for(int i= 1;i<=max(n,200ll);i++)a[i] = 0;
	for(int i = 1;i<=n;i++)a[rk[i]]++;
	for(int i = 1;i<=max(n,200ll);i++)a[i]+=a[i-1];
	for(int i =n;i>=1;i--)sa[a[rk[tp[i]]]--] = tp[i];
}void SA(){
	for(int k = 1;k<=n;k<<=1){
		int tot =0;
		for(int i = n-k+1;i<=n;i++)tp[++tot] =i;
		for(int i = 1;i<=n;i++)if(sa[i]>k)tp[++tot] = sa[i]-k;
		qsort();swap(tp,rk);rk[sa[1]] = 1;
		for(int i = 2;i<=n;i++)rk[sa[i]] = rk[sa[i-1]]+1-(tp[sa[i]] == tp[sa[i-1]] and tp[sa[i]+k] == tp[sa[i-1]+k]);
	}return;
}
void GET_HEIGHT(){
	int l = 0;
	for(int i = 1;i<=n;i++)rk[sa[i]] = i;
	for(int i = 1;i<=n;i++){
		if(rk[i] == 1)continue;
		if(l)--l;
		int j = sa[rk[i]-1];
		while(i+l<=n and j+l<=n and s[i+l] == s[j+l])l++;
		h[rk[i]] = l;
	}for(int i = 1;i<=n;i++)st[i][0] = h[i];
	for(int i = 1;i<=18;i++){
		for(int j = 1;j+(1<<i)-1<=n;j++){
			st[j][i] = min(st[j][i-1],st[j+(1<<i-1)][i-1]);
		}
	}for(int i =1;i<=n;i++)d[i] = (n-sa[i]+1)-h[i];
	for(int i = 1;i<=n;i++)pred[i] = pred[i-1]+d[i];
	return;
}inline int query(int l,int r){
	int id = rk[l],len = r-l+1;int now = id;
	for(int i = 18;i>=0;i--){
		int p = now-(1<<i)+1;
		if(p<1)continue;
		if(st[p][i]>=len)now = p-1;
	}int ans = pred[now-1]+(len-h[now]);
	return pred[n]-ans+1;
}vector<pair<int,int> >ans;
bool cmp(pair<int,int>a,pair<int,int>b){
	return a.first<b.first;
}signed main(){
	for(int i =0;i<20;i++){
		for(int j = (1<<i);j<(1<<i+1);j++)lg[j] = i;
	}scanf("%s",s+1);n = strlen(s+1);
	for(int i = 1;i<=n;i++)cin >>A[i];
	for(int i = 1;i<=n;i++)pre[i] = pre[i-1]+A[i];
	for(int i = 1;i<=n;i++){
		rk[i] = s[i];tp[i] = i;
	}qsort();
//	for(int i = 1;i<=n;i++)cout<<sa[i]<<' ';;cout<<endl;
//	for(int i =1;i<=n;i++)cout<<rk[i]<<' ';cout<<endl;
	SA();GET_HEIGHT();
//	for(int i = 1;i<=n;i++)cout<<sa[i]<< ' ';cout<<endl;
/////	for(int i = 1;i<=n;i++)cout<<rk[i]<<' ';cout<<endl;
//	for(int i = 1;i<=n;i++)cout<<h[i]<<' ';cout<<endl;
//	cout<<query(1,1)<<" "<<query(3,4)<<' '<<query(4,4)<<endl;
	for(int i = 1;i<=n;i++){
		int l = i,r = n;
		while(l<=r){
			int mid = l+r+1>>1;
			int rk = query(i,mid);
			if(rk == pre[mid]-pre[i-1]){ans.push_back({i,mid});break;}
		//	cout<<l <<' '<<r<<' '<<i<< ' '<<mid<<' '<<rk<<' '<<pre[mid]-pre[i-1]<<endl;
			if(rk>pre[mid]-pre[i-1])l = mid+1;
			else r = mid-1;
		}
	}sort(ans.begin(),ans.end(),cmp);
	cout<<ans.size()<<'\n';
	for(int i = 0;i<ans.size();i++){
		cout<<ans[i].first<<" "<<ans[i].second<<'\n';
	}
	return 0;
}