Codeforces Round #246 (Div. 2) D. Prefixes and Suffixes

You have a string s = s₁s₂...s_|s|, where |s| is the length of string s, and s_i its i-th character.

Let's introduce several definitions:

• A substring s[i..j] (1 ≤ i ≤ j ≤ |s|) of string s is string s_is_i + 1...s_j.
• The prefix of string s of length l (1 ≤ l ≤ |s|) is string s[1..l].
• The suffix of string s of length l (1 ≤ l ≤ |s|) is string s[|s| - l + 1..|s|].

Your task is, for any prefix of string s which matches a suffix of string s, print the number of times it occurs in string s as a substring.

Input

The single line contains a sequence of characters s₁s₂...s_|s| (1 ≤ |s| ≤ 10⁵) — string s. The string only consists of uppercase English letters.

Output

In the first line, print integer k (0 ≤ k ≤ |s|) — the number of prefixes that match a suffix of string s. Next print k lines, in each line print two integers l_i c_i. Numbers l_i c_i mean that the prefix of the length l_i matches the suffix of length l_i and occurs in string s as a substring c_i times. Print pairs l_i c_i in the order of increasing l_i.

Examples

Input

ABACABA

Output

3
1 4
3 2
7 1

Input

AAA

Output

3
1 3
2 2
3 1

题意：给你一个字符串，问你即是前缀又是后缀的子串有哪些，且在总串中出现了几次。

分析：kmp求出next数组后，用DP的方式统计出next[k]出现的次数。

#include <cstdio>
#include <iostream>
using namespace std;
string s;
int tot,Next[100005],ans[100005];
bool jud[100005];
int main()
{
	cin.sync_with_stdio(false);
	cin>>s;
	int m = s.length();
	int now = Next[0] = -1;
	for(int i = 1;i < m;i++)
	{
		while(now >= 0 && s[now+1] != s[i]) now = Next[now];
		if(s[now+1] == s[i]) now++;
		Next[i] = now;
		ans[now]++;
	} 
	for(int i = m-1;i;i--) 
	 if(Next[i] >= 0) ans[Next[i]] += ans[i];
	for(int i = Next[m-1];i >= 0;i = Next[i])
	{
		jud[i] = true;
		tot++;	
	}
	cout<<tot+1<<endl;
	for(int i = 0;i < m;i++) 
	 if(ans[i] && jud[i]) cout<<i+1<<" "<<ans[i]+1<<endl; 
	cout<<m<<" "<<1<<endl; 
 }