you give stre s array string word all string word lengthA concatenate substre s substring contain string permutation word concatenatedfor example word abcdef abcdef abefcd cdabef cdefab efabcd efcdab concatenate string acdbef concatenate substre concatenation permutation wordsreturn start index concatenate substring s you return answer order Example 1input s barfoothefoobarman word foobaroutput 09explanation since wordslength 2 wordsilength 3 concatenate substring length 6the substring start 0 barfoo it concatenation barfoo permutation wordsthe substring start 9 foobar it concatenation foobar permutation wordsThe output order matter return 90 fine tooexample 2input s wordgoodgoodgoodbestword word wordgoodbestwordOutput Explanation since wordslength 4 wordsilength 4 concatenate substring length 16there substre length 16 s equal concatenation permutation wordsWe return arrayExample 3Input s barfoofoobarthefoobarman word barfootheOutput 6912explanation since wordslength 3 wordsilength 3 concatenate substre length 9the substring start 6 foobarthe it concatenation foobarthe permutation wordsthe substring start 9 barthefoo it concatenation barthefoo permutation wordsthe substre start 12 thefoobar it concatenation thefoobar permutation word Constraints1 slength 1041 wordslength 50001 wordsilength 30 wordsi consist lowercase english letter