Problem: Kilani and Abd are neighbors for 3000 years, but then the day came and Kilani decided to move to another house. As a farewell gift, Kilani is going to challenge Abd with a problem written by their other neighbor with the same name Abd.

<image>

The problem is:

You are given a connected tree rooted at node 1.

You should assign a character a or b to every node in the tree so that the total number of a's is equal to x and the total number of b's is equal to n - x.

Let's define a string for each node v of the tree as follows: 

  * if v is root then the string is just one character assigned to v: 
  * otherwise, let's take a string defined for the v's parent p_v and add to the end of it a character assigned to v. 



You should assign every node a character in a way that minimizes the number of distinct strings among the strings of all nodes.

Input

The first line contains two integers n and x (1 ≤ n ≤ 10^5; 0 ≤ x ≤ n) — the number of vertices in the tree the number of a's.

The second line contains n - 1 integers p_2, p_3, ..., p_{n} (1 ≤ p_i ≤ n; p_i ≠ i), where p_i is the parent of node i.

It is guaranteed that the input describes a connected tree.

Output

In the first line, print the minimum possible total number of distinct strings.

In the second line, print n characters, where all characters are either a or b and the i-th character is the character assigned to the i-th node.

Make sure that the total number of a's is equal to x and the total number of b's is equal to n - x.

If there is more than one answer you can print any of them.

Example

Input


9 3
1 2 2 4 4 4 3 1


Output


4
aabbbbbba

Note

The tree from the sample is shown below:

<image>

The tree after assigning characters to every node (according to the output) is the following:

<image>

Strings for all nodes are the following: 

  * string of node 1 is: a
  * string of node 2 is: aa
  * string of node 3 is: aab
  * string of node 4 is: aab
  * string of node 5 is: aabb
  * string of node 6 is: aabb
  * string of node 7 is: aabb
  * string of node 8 is: aabb
  * string of node 9 is: aa



The set of unique strings is \{a, aa, aab, aabb\}, so the number of distinct strings is 4.

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
using namespace std;
#define N 100010
typedef long long ll;
inline ll read(){
	ll x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		x=(x<<1)+(x<<3)+c-'0';
		c=getchar();
	}
	return x*f;
}
int n,f[N],dep[N],mx,cnt[N],x,lc[N];
vector<int> G[N];
bitset<N> dp[1333];
int s[N],vis[N],tot;
vector<int> z[N];
void dfs(int u){
	dep[u]=dep[f[u]]+1;
	++cnt[dep[u]],mx=max(mx,dep[u]);
	if(G[u].empty())++lc[dep[u]];
	for(auto v:G[u]){
		dfs(v);
	}
}
int ok[N];
void Find(int u,int t){
	if(!u)return;
	int o=0;
	for(;o<(int)z[u].size();++o){
		if(s[u]>t||dp[u-1][t])break;
		t-=s[u],ok[z[u][o]]=1;
	}
	Find(u-1,t);
}	
int main(){
	n=read(),x=read();
	for(int i=2;i<=n;++i){
		f[i]=read();
		G[f[i]].push_back(i);
	}
	dfs(1);
	for(int i=1;i<=mx;++i){
		if(vis[cnt[i]]){
			z[vis[cnt[i]]].push_back(i);
		}
		else{
			vis[cnt[i]]=++tot;
			s[tot]=cnt[i];
			z[tot].push_back(i);
		}
	}
	dp[0][0]=1;
	
	for(int i=1;i<=tot;++i){
		dp[i]=dp[i-1];
		for(int j=1;j<=(int)z[i].size();++j){	
			dp[i]|=(dp[i]<<s[i]);
		}
	}
	if(dp[tot][x]){
		printf("%d\n",mx);
		Find(tot,x);
		for(int i=1;i<=n;++i){
			putchar(ok[dep[i]]?'a':'b');
		}
	}
	else{
		int res=23333333;
		for(int i=x;i>=0;--i){
			if(dp[tot][i]){
				res=i;
				break;
			}
		}
		Find(tot,res);
		int pos=-1;
		for(int i=1;i<=mx;++i){
			if(!ok[i]&&lc[i]>=x-res){
				pos=i;break;
			}
		}
		assert(~pos);
		printf("%d\n",mx+1);
		for(int i=1;i<=n;++i){
			if(dep[i]==pos&&G[i].empty()){
				if(res==x){
					putchar('b');
				}
				else putchar('a'),++res;
			}
			else putchar(ok[dep[i]]?'a':'b');
		}
	}
	return 0;
}