We can construct word if all letters in are at least in some word among for all .
Let's show why this is true. We know that substring is suffix of some prefix (for substring from l to r you can take prefix from 1 to r and then suffix of it from l to r), so if we need some letter in , we find it in , write out it's prefix where the last letter is needed and then take suffix of length 1. If we do this for all letters we need, we will have words out of 1 letters, that can construct word one letter by one.