You are given a string *q*. A sequence of *k* strings *s*<sub class="lower-index">1</sub>, *s*<sub class="lower-index">2</sub>, ..., *s*<sub class="lower-index">*k*</sub> is called beautiful, if the concatenation of these strings is string *q* (formally, *s*<sub class="lower-index">1</sub> + *s*<sub class="lower-index">2</sub> + ... + *s*<sub class="lower-index">*k*</sub> = *q*) and the first characters of these strings are distinct.

Find any beautiful sequence of strings or determine that the beautiful sequence doesn't exist.
The first line contains a positive integer *k* (1 ≤ *k* ≤ 26) — the number of strings that should be in a beautiful sequence. 

The second line contains string *q*, consisting of lowercase Latin letters. The length of the string is within range from 1 to 100, inclusive.
import sys
import math
import collections
import bisect
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_list(): return list(map(int, sys.stdin.readline().strip().split()))
def get_string(): return sys.stdin.readline().strip()
for t in range(1):
    n,k=get_ints()
    if k>math.ceil(n/2):
        print("NO")
        continue
    ans=[]
    mul=0
    count=0
    for i in range(n):
        row=["S"]*n
        for j in range(n):
            if j%2==0:
                if mul%2==0 and count<k:
                    row[j]="L"
                    count+=1
            elif j%2==1:
                if mul%2==1 and count<k:
                    row[j]="L"
                    count+=1
        mul+=1
        ans.append(row)
    print("YES")
    for i in ans:
        print(*i,sep="")
