Combinatorics questions about set partition

[arborm]

In "Question": "How many ways are there to divide a set of 5 elements into 2 non-empty ordered subsets?", the answer is 240 which I don't understand. Mentioned explanation is in file "explanation": "solutions/Lah_number_2.txt" but the directory solutions was not uploaded. Would be greatly appreciated if some explanation of why there are 240 ways to divide 5 elements into 2 nonempty ordered subsets could be added.