In the burial place of King Silo of Asturias there is an inscription that reads SILO PRINCEPS FECIT (King Silo made this).

The first letter is found in the very middle, and from there one reads by going in any non-diagonal direction radiating outward. The final letter is found on all four corners. In this challenge, you'll generalize the process to make them.

Input

A string (or equivalent), and an integer. You may make the following assumptions about the input:

• The string will have an odd length.


• The integer will be an odd number between 1 and one less than twice the length of the string.

Output

An inscriptio labyrinthica for the string, using the integer for the height (see models). Output should be each letter with no spaces, line break as default to your system/language.

Test cases

Note that an input of 1 or (length * 2 - 1) will result in a horizontal or vertical palindrome.

 Input: FOO, 3 Input: BAR, 1 Input: BAR, 3 Input: BAR, 5

Output: OOO Output: RABAR Output: RAR Output: R
 OFO ABA A
 OOO RAR B
 A
 R

 Input: ABCDE, 5 Input: ABCDE, 3 Input: *<>v^, 5

Output: EDCDE Output: EDCBCDE ^v>v^
 DCBCD DCBABCD v><>v
 CBABC EDCBCDE ><*<>
 DCBCD v><>v
 EDCDE ^v>v^

Scoring

This is code-golf so shortest answer in bytes wins. Standard loopholes forbidden.

Charcoal, 25 19 bytes

Ｅ⊘⊕η✂θκ⁺κ⁻Ｌθ⊘⊖η‖Ｏ←↑

Try it online! Link is to verbose version of code. Explanation:

Ｅ⊘⊕η✂θκ⁺κ⁻Ｌθ⊘⊖η

Draw a quarter of the inscription.

‖Ｏ←↑

Reflect to complete the inscription.

Jelly, 12 bytes

Uṡṛ‘HɗŒBŒḄZY

Try it online!

A dyadic link taking the string as its left and height as its right argument. Returns a string with line breaks. If a list of strings were acceptable for output, I can remove the final Y saving a byte. Interestingly the original “SILO PRINCEPS FECIT” looks to me like ASCII art of a 3D diamond when I look at it on TIO.

R, 93 bytes

function(s,H,h=H/2-.5,w=length(s)-h-1)write(s[1+outer(abs(-w:w),abs(-h:h),`+`)],"",2*w+1,,"")

Try it online!

Takes input as a vector of characters.

First compute $w$ and $h$ such that the output is of size $(2w+1)times(2h+1)$.

In the output, we want the character in position $(i,j)$ to be the $1+|i-h|+|j-w|$ th character of the input. The rest is formatting.

Japt -R, 19 16 bytes

z
ò@VÔtYVÊaU)êÃê

Try it