Cutting into three pieces

You are given two strings. Cut the second string into three non-empty pieces, then concatenate the three pieces in an order of your choice. Decide whether the result can equal the first string.

Each piece is a contiguous part of the second string, and the three pieces may be placed in any order.

The first line contains the first string. The second line contains the second string.

Both strings are non-empty, have the same length, and consist of lowercase latin letters only. The length is at most $5\,000$. Every letter occurs the same number of times in both strings.

If the first string can be built this way, print YES on the first line, then print the three pieces on the next three lines, one per line, in the order that concatenates to the first string. No piece may be empty. Otherwise print NO on a single line.

If several cuts work, print the one whose first piece is shortest. If several of those remain, print the one whose second piece is shortest.