Given a coded message and a key, the real message is hidden inside it, and we need to crack the code and return it. Each word in the message will have a number as a prefix. If a word's prefix number is perfectly divisible by the given key, then the word following it will be part of the decoded message.
For example: