Innokentiy decides to change the password in the social net "Contact!", but he is too lazy to invent a new password by himself. That is why he needs your help. 

Innokentiy decides that new password should satisfy the following conditions:  the length of the password must be equal to n,  the password should consist only of lowercase Latin letters,  the number of distinct symbols in the password must be equal to k,  any two consecutive symbols in the password must be distinct. 

Your task is to help Innokentiy and to invent a new password which will satisfy all given conditions. 


-----Input-----

The first line contains two positive integers n and k (2 ≤ n ≤ 100, 2 ≤ k ≤ min(n, 26)) — the length of the password and the number of distinct symbols in it. 

Pay attention that a desired new password always exists.


-----Output-----

Print any password which satisfies all conditions given by Innokentiy.


-----Examples-----
Input
4 3

Output
java

Input
6 6

Output
python

Input
5 2

Output
phphp



-----Note-----

In the first test there is one of the appropriate new passwords — java, because its length is equal to 4 and 3 distinct lowercase letters a, j and v are used in it.

In the second test there is one of the appropriate new passwords — python, because its length is equal to 6 and it consists of 6 distinct lowercase letters.

In the third test there is one of the appropriate new passwords — phphp, because its length is equal to 5 and 2 distinct lowercase letters p and h are used in it.

Pay attention the condition that no two identical symbols are consecutive is correct for all appropriate passwords in tests.

Difficulty: interview

Starter code:

Solutions:
n, k = map(int, input().split())
print(('abcdefghijklmnopqrstuvwxyz'[:k] * n)[:n])

n, k = input().split()
n, k = int(n), int(k)
s = []
for i in range(n):
	s.append(chr((i % k + ord('a'))))
print(''.join(s))

n, k = map(int, input().split())
const = ''
ans = ''
for i in range(k):
    const += chr(i + 97)
ans = (n // k) * const
ans += const[:n % k]
print(ans)

import string

n, k = map(int, input().split())

symbs = []
letters = string.ascii_lowercase[:k]
last = 0
for i in range(n):
	symbs.append(letters[last])
	last+=1
	if last==k:
		last = 0
print(''.join(symbs))

import string

n, k = (int(i) for i in input().split())
str = string.ascii_lowercase[:k]

ans = str * (n // k) + str[:(n % k)]

print(ans)


#This code is dedicated to Olya S.

password=''
n,k=list(map(int,input().split()))
alph=[chr(i) for i in range(97,97+k)]

for i in range(n):
    password+=alph[i%k]

print(password)
    



(lambda n, k: print(*([chr(i + ord('a')) for i in range(k)] * (n // k + 1))[:n], sep=''))(*map(int, input().split()))

n, k = map(int, input().split())

abc = 'abcdefghijklmnopqrstuvwxyz'

for i in range(n):
	print(abc[i % k], end = '')

print()


n, k = list(map(int, input().split()))
s = []
l = ""
for i in range(k):
    s.append(chr(97 + i))
for i in range(len(s)):
    l += s[i]
for i in range(n//k):
    print(l,end='')
for i in range(n%k):
    print(s[i],end='')

""" Created by Shahen Kosyan on 3/11/17 """

def __starting_point():
    n, k = [int(x) for x in input().split()]
    kc = k

    alphabet = 'abcdefghijklmnopqrstuvwxyz'
    alphabet = list(alphabet)
    password = ''

    i = 0
    while kc > 0:
        password += alphabet[i]
        kc -= 1
        i += 1

    i = 0
    while len(password) < n:
        if i == k:
            i = 0
        password += password[i]
        i += 1

    print(password)

__starting_point()

n, k = list(map(int, input().split()))
s = 'abcdefghijklmnopqrstuvwxyz'
res = ""
for i in range(n):
    res += s[i%k]

print(res)


import string

alphabet = string.ascii_lowercase

n, k = map(int, input().split())

le = min(k, 26)

index = 0
result = ''

for i in range(1, n+1):
    result+=alphabet[int(index)]
    index+=1
    if index >= k:
        index = 0
print(result)

n,k=[int(c) for c in input().split(' ')]
aCode=ord('a')
passwd,temp='',''
for i in range(0,k):
    temp+=chr(aCode+i)
count=n//k
rest=n%k
passwd=temp*count
if rest>0:
    passwd+=temp[:rest]
print(passwd)

n,k = map(int, input().split()) 
s = '' 
x = n // k 
y = n % k 
for i in range(x): 
    for j in range(k): 
        p = str(chr(97 + j)) 
        s = s + p 
for i in range(y): 
    p = str(chr(97 + i)) 
    s = s + p 
print(s)

a,b = map(int, input(). split())
A=['a','b', 'c', 'd', 'e', 'f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
if a==b:
    for i in range(a):
        print(A[i],end='')
else:
    while a>=b:
        for i in range(b):
            print(A[i],end='')
        a=a-b
    for j in range(a):
        print(A[j],end='')


nk=input().split()
n=int(nk[0])
k=int(nk[1])
password=''
i=0
j=0
for i in range(n):
    if j<k:
        password=password+chr(97+j)
        j+=1
    else:
        j=0
        password=password+chr(97+j)
        j+=1
print(password)


n,k=list(map(int, input().split()))
chars=['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
use_chars=chars[:k]
password=" "
x=0
for char_i in range(1,n+1):
    current_char=use_chars[x]
    if password[char_i-1] == current_char:
        current_char=use_chars[x]
    if x+1 == k:
        x=0
    else:
        x+=1
    password+=current_char
print(password[1:])