Special Problem
Time: 1 s
Memory: 125 MB
Memory: 125 MB
Alice decides to set a new password for coderOJ that should satisfy the following conditions:
- the length of the password must be equal to \(n\),
- the password should consist only of upperrcase Latin letters,
- the number of distinct symbols in the password must be equal to \(k\)
Input
The first line contains two positive integers \(n\) and \(k\)— the length of the password and the number of distinct symbols in it.
Constraint
\(1 \leq n \leq 100\\ 1 \leq k \leq min( \,n,26) \,\)
Output
Print any password which satisfies all conditions.
Examples
| Input | Output |
|---|---|
|
4 3
|
RAJA
|
| Input | Output |
|---|---|
|
5 5
|
ABCDE
|
| Input | Output |
|---|---|
|
5 4
|
PQRSS
|