#Jolf, 40 Bytes#
Jolf, 40 Bytes
Wά)Ζ0W<ζli)? h++i]Iζ+ζniIoά0nΖhζ}onhn}wn I'm quite new to Jolf, learned a lot while figuring this out. Seems a bit awkward, still could probably could be golfed down further. Even knocked off 2 bytes while writing this explanation.
Explanation:
Wά) While ά (initialized to 16) Ζ0 Set ζ to 0 W<ζli) While ζ < length(A) ? h++i]Iζ+ζniIoά0n Set ά to 0 if (A + a substring from B of length n + A) contains B Ζhζ Increment ζ }onhn Increment n (initialize to 0 }wn Decrement n and print