You are given a string target, an array of strings words, and an integer array costs, both arrays of the same length. Imagine an empty string s. You can perform the following operation any number of times (including zero): Return the minimum cost to make s equal to target. If it's not possible, return -1.