Polo the Penguin and Strings

								 ***Polo the Penguin and Strings*** 

Little penguin Polo adores strings. But most of all he adores strings of length n.

One day he wanted to find a string that meets the following conditions:

The string consists of n lowercase English letters (that is, the string’s length equals n), exactly k of these letters are distinct.
No two neighbouring letters of a string coincide; that is, if we represent a string as s = s1s2… sn, then the following inequality holds, si ≠ si + 1(1 ≤ i < n).
Among all strings that meet points 1 and 2, the required string is lexicographically smallest.
Help him find such string or state that such string doesn’t exist.

String x = x1x2… xp is lexicographically less than string y = y1y2… yq, if either p < q and x1 = y1, x2 = y2, … , xp = yp, or there is such number r (r < p, r < q), that x1 = y1, x2 = y2, … , xr = yr and xr + 1 < yr + 1. The characters of the strings are compared by their ASCII codes.

Input
A single line contains two positive integers n and k (1 ≤ n ≤ 106, 1 ≤ k ≤ 26) — the string’s length and the number of distinct letters.

Output
In a single line print the required string. If there isn’t such string, print “-1” (without the quotes).

Examples
Input
7 4
Output
ababacd
Input
4 7
Output
-1
题意：n代表字符个数，k代表n中有多少个不同的字符，输出按照ASCII的最小字典序。
思路：k代表不同的字符，所以可以把前n-k+2个字符用字符a和b相互交换，在倒数n-k-1个按照字典序依次输出即可。

#include"iostream"
#include"cstdio"
#include"cstring"
using namespace std;
int main()
{
	int n,k;
	while(cin>>n>>k)
	{
		if(n==k&&k==1)
		{
			cout<<"a"<<endl;
			return 0;
		}
		else if((n<k)||(k==1&&n!=1))
		{
			cout<<-1<<endl;
		}
		else
		{
			for(int i=0;i<n-(k-2);i++)
			{
				if(i%2==0)
				{
					cout<<"a";
				}
				else
				{
					cout<<"b";
				}
			}
			for(int i=0;i<k-2;i++)
			{
				printf("%c",'c'+i);
			}
			cout<<endl;
		}
	}
	return 0;
}