A number arrangement machine rearranges a given input line of words through a series of steps. The following example illustrates the process: Input: s...

A number arrangement machine rearranges a given input line of words through a series of steps. The following example illustrates the process:

Input: stadium language lunatic ambition condition consonant

Step I: stadium lunatic language consonant condition ambition
Step II: ttadiun munatid manguagf donsonanu donditioo bmbitioo
Step III: adinttu adimntu aafggmnu adnnnoosu ddiinooot bbiimoot
Step IV: bejouuv bejnouv bbghhnov beooopptv eejjopppu ccjjnppu
Step V: bbghhnov bejnouv bejouuv beooopptv ccjjnppu eejjopppu

Step V is the final step of the rearrangement.

Based on this logic, find the words in Step III for the following input:

dangerous duplicate murder cannot survive triangle