Problem: Please pay attention to the unusual memory limit in this problem.

In a parallel universe, Satan is called "Trygub". For that reason, the letters of his namesake were deleted from the alphabet in ancient times.

The government has n workers standing in a row and numbered with integers from 1 to n from left to right. Their job categories can be represented as a string s of length n, where the character s_i represents the job category of the i-th worker.

A new law will be approved to increase the equality between the workers. The government decided to make everyone have the same job category by performing the following operation any number of times (possibly zero).

There is a fixed rational parameter k=\frac ab describing how easy it is to convince the public, and it will be used to determine the success of an operation.

In an operation, the government first selects a job category x with at least one worker at the current moment. Suppose i_1,…, i_m (i_1<…<i_m) are the positions of all the workers with job category x. If k⋅ (i_m-i_1+1)≤ m, the government is able to choose any job category y with at least one worker at the current moment and change the job category of all workers with job category x to job category y.

If it is possible to make all workers have job category x, we say that x is obtainable. Can you tell the government the set of obtainable job categories?

Input

The first line contains three integers n, a, b (1 ≤ n ≤ 5000, 1≤ a≤ b≤ 10^5) — the number of workers and the numerator and denominator of the parameter k, respectively.

The second line contains a string s of length n, consisting of lowercase English characters — the job categories of each worker. The characters 't', 'r', 'y', 'g', 'u', and 'b' do not appear in the string s.

Output

Print an integer c equal to the number of obtainable job categories followed by c space-separated characters — the obtainable job categories sorted in the lexicographical order.

Example

Input


7 1 2
comicom


Output


3 c m o

Note

The first operation must select the job category 'i' because all other job categories cannot satisfy the condition, therefore 'i' is not obtainable.

Below is showed how to obtain 'c', 'm', and 'o'. The square brackets denote the segment containing all workers of the selected category, the red color denotes this category and the blue color denotes the new category after the change.

  * Get 'c': 
    1. (com\color{red}{[i]}com → com\color{#1E90FF}{[o]}com) 
    2. (c\color{red}{[o}m\color{red}{o}c\color{red}{o]}m → c\color{#1E90FF}{[m}m\color{#1E90FF}{m}c\color{#1E90FF}{m]}m) 
    3. (c\color{red}{[mmm}c\color{red}{mm]} → c\color{#1E90FF}{[ccc}c\color{#1E90FF}{cc]}) 
  * Get 'm': 
    1. (com\color{red}{[i]}com → com\color{#1E90FF}{[o]}com) 
    2. (c\color{red}{[o}m\color{red}{o}c\color{red}{o]}m → c\color{#1E90FF}{[c}m\color{#1E90FF}{c}c\color{#1E90FF}{c]}m) 
    3. (\color{red}{[cc}m\color{red}{ccc]}m → \color{#1E90FF}{[mm}m\color{#1E90FF}{mmm]}m) 
  * Get 'o': 
    1. (com\color{red}{[i]}com → com\color{#1E90FF}{[c]}com) 
    2. (\color{red}{[c}om\color{red}{cc]}om → \color{#1E90FF}{[m}om\color{#1E90FF}{mm]}om) 
    3. (\color{red}{[m}o\color{red}{mmm}o\color{red}{m]} → \color{#1E90FF}{[o}o\color{#1E90FF}{ooo}o\color{#1E90FF}{o]}) 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
	t=0; char ch=getchar(); int f=1;
	while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
	do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
const int INF=0x7f7f7f7f;
int n,a,b,cnt,l[1<<20],r[1<<20];
char s[5010],bk[30];
map<char,int> M;
int S[1<<20],f[1<<20];
vector<char> ans;
int main() {
	//freopen("1.txt","r",stdin);
	read(n),read(a),read(b); scanf("%s",s+1); int x;
	memset(l,INF,sizeof(l));
	for (int i=1;i<=n;i++) {
		x=M[s[i]]; if (!x) M[s[i]]=++cnt,bk[cnt]=s[i],x=cnt;
		l[1<<(x-1)]=min(l[1<<(x-1)],i);
		r[1<<(x-1)]=i;
		S[1<<(x-1)]++;
	}
	for (int t=1;t<(1<<cnt);t++)
	for (int i=0;i<cnt;i++) if (t&(1<<i)) {
		S[t]=S[t-(1<<i)]+S[1<<i];
		l[t]=min(l[t-(1<<i)],l[1<<i]);
		r[t]=max(r[t-(1<<i)],r[1<<i]);
	}
	f[0]=1;
	for (int t=1;t<(1<<cnt);t++) {
		int pre=0;
		for (int i=0;i<cnt;i++) if (t&(1<<i)) {
			pre+=(1<<i);
			if (f[t-pre]&&f[pre]) f[t]=1;
			if (f[t-(1<<i)]&&a*(r[t]-l[t]+1)<=b*S[t]) f[t]=1;
			if (f[t]) break;
		}
	//	printf("%d %d %d %d\n",t,l[t],r[t],S[t]);
	}
	for (int i=0;i<cnt;i++) if (f[(1<<cnt)-1-(1<<i)]) ans.push_back(bk[i+1]);
	sort(ans.begin(),ans.end());
	printf("%d ",(int)ans.size());
	for (char ch : ans) printf("%c ",ch);
	puts("");
	
	return 0;
}
/*
  REMEMBER:
  1. Think TWICE, Code ONCE!
  Are there any counterexamples to your algo?
    
  2. Be careful about the BOUNDARIES!
  N=1? P=1? Something about 0?
    
  3. Do not make STUPID MISTAKES!
  Array size? Integer overflow? Time complexity? Memory usage? Precision error?
*/