Put the line in the code you nut and shake it all up Using one programming language write 5 single-line programs, each of which outputs a different line of the first verse to Harry Nilsson's 1972 song &quot;Coconut&quot; when run individually:

Brother bought a coconut, he bought it for a dime
His sister had another one, she paid it for a lime
She put the lime in the coconut, she drank them both up
She put the lime in the coconut, she drank them both up
She put the lime in the coconut, she drank them both up

(full lyrics)
The last 3 lines have the same lyrics, so your last 3 programs might be as well.
There are 5 factorial or 120 ways these 5 single-line programs can be arranged one per line in a single 5-line program. You must optimize your single-line programs such that for as many of these 120 combinations as possible the 5-line program outputs the entire verse in its proper order, exactly as it appears above.
Example
The simplest answer would have 5 single line print statements, the last 3 identical:
print('Brother bought a coconut, he bought it for a dime')
print('His sister had another one, she paid it for a lime')
print('She put the lime in the coconut, she drank them both up')
print('She put the lime in the coconut, she drank them both up')
print('She put the lime in the coconut, she drank them both up')
The output to the 5-line programs will be the verse in its proper order as long as the first two single-liners are in their correct places. Only 6 of the 120 possible arrangements accomplish this.
Scoring
The submission with the most working cases out of all 120 wins. Tie breaker goes to the set of programs with the lowest cumulative byte count (newlines not counted). The example has 309 bytes.
Details

Your programs may not read their own source code. Nor should they read other external files or require a network connection.

Output to stdout or closest alternative. You may also output to a file with the name of your choice.

&quot;Single-line programs&quot; are strings that contain any characters except line terminators (you'll probably just need to worry about newlines)
.

When composing the single-liners into the 5-liners you should add exactly 4 newlines, one between each adjacent pair of single-liners. You may optionally add a trailing newline.
CJam, 120 valid permutations, 334 299 290 bytes
&quot;She put the lime in the coconut, she drank them both up&quot;N+
&quot;Brother bought a coconut, he bought it for a dime&quot;N+]$~
&quot;She put the lime in the coconut, she drank them both up&quot;N+
&quot;His sister had another one, she paid it for a lime&quot;N+]$~
&quot;She put the lime in the coconut, she drank them both up&quot;N+

Pretty simple logic:

Put each line of the song in each of the 5 programs
Wrap everything on stack in an array
Sort the array
Unwrap the array so that the next program can use the same logic
In each step, we have the partial lyrics in an array. Luckily, sorting the array gives the correct order of the lyrics.

UPDATE: Turns out that you don't need the wrap-sort-unwrap cycle after the 3 similar and appearing at the end lines of the song. I can explain why if its not that apparent :)