For this Question: Given two integers N and K. Construct a max diversity string of length N and period K. Among all possible strings, find the lexographically minimum string.
A max diverse string is a string with maximum number of different characters.
A string with period K is a string made by a string of length K repeated multiple times.
Note: You can use only lowercase characters from 'a' to 'z'.The first and the only line of input contains two integers N and K.

Constraints:
1 <= N <= 100000
1 <= K <= min(N,100)
N is divisible by K.Print the required string.Sample Input 1
4 2

Sample Output 1
abab

Sample Input 2
4 1

Sample Output 2
aaaa, I have written this Solution Code: import copy,math
x,y = input().split()
x = int(x)
y = int(y)
s = ""
if y>26:
	s = ('a'*(y-26))+("".join(chr(97+i) for i in range(26)))
else:
	s = "".join(chr(97+i) for i in range(y))

print(s*(x//y)), In this Programming Language: Python, Now tell me if this Code is compilable or not?