Consider a 20-sided convex polygon K, with vertices in that order. Find the number of ways in which three sides of K can be chosen so that every pair among them has at least two sides of K between them. (For example is an admissible triple while is not.) (RMO 2011)
.
.