<s>[INST] In this problem, you are given three arrays of strings: words, wordA, and wordB. words is a list of 10,000 common English words, and wordA and wordB are two specific words that you need to find the shortest path between in a graph of word neighbors.[/INST]