SMO 1997 Problem 4

Let $n \ge 2$ be a positive integer. Suppose that $a_1,a_2,...,a_n$ and $b_1,b_2,...,b_n$ are 2n numbers such that $\sum_{i=1}^n a_i =\sum_{i=1}^n n_i= 1$ and $a_i\ge 0, 0 \le b_i\le \frac{n-1}{n}, i = 1, 2,..., n$ . Show that $$b_1a_2a_3...a_n+a_1b_2a_3...a_n+...+a_1a_2...a_{k-1}b_ka_{k+1}...a_n+ ...+ a_1a_2...a_{n-1}b_n \le \frac{1}{n(n-1)^{n-2}}$$