BeCareful!: Bombastic Queue

Mr. Bombastic wants to enqueue his students in a row. There are 7 students in the class that are queued according to their heights from shortest to longest currently. Mr. Bombastic has a taste of fashion and does not like orderly stuff. So he decides to disrupt the queue. However, the school directors only permit 2 but only 2 swaps starting from height order. A swap is between any two students. So how many different queue options does Mr. Bombastic have by exactly two successive swaps?
Note: There was a confusion about number of swaps available. It is EXACTLY two swaps. No more no less.