This question is a continuation of the first question: Musical Chairs Cipher.
The basic rules:
Six children -- Alice, Ben, Carl, Denise, Eddie, and Flo -- are playing a game of musical chairs in class. On each of the five chairs is written a seven letter word.
The children start out in alphabetical order, and maintain that same order through the whole game. At the end of each round, each person sits in a chair, except for one, who is out.
Then, each of the sitting children scribbles out the word on their chair, in its place writing the same word under a vigenere cipher, using their name as the key.
One chair is then removed before resuming the game, which continues until there is only one person left. When removed, the word written on the chair is no longer changed. The final chair's word is still changed by the winner.
So Alice, Bob, Carl, Denise, Eddie, and Flo are going to play another round of musical chairs in class when they are approached by Greg, Hillary, and Ivan, all of them wanting to play as well.
Greg, Hillary, and Ivan are not nearly as well behaved as the rest of the children, so while the others stay in the same alphabetical order through the whole game, they instead are hopping, pushing, and running all around the circle, constantly changing their positions between rounds. Other than that, they follow all the same rules as the rest.
Their teacher, not wanting to leave anyone out of the game, brings in three more chairs and writes up some more words, but she doesn't check to make sure they are the same length as the others.
If the game began with the words:
And ended with:
What order did the children get out, and who won?
NOTE: I will accept code-based answers, but I expect a bit more than brute force.