Before revision:  The best previous upper bound, just for the number of non-compact components, in the special case where k\!=\!3 and \{a_1, \ldots,a_{n+k\}\!
After revision:  The best previous upper bound, just for the number of non-compact components, in the special case where k\!=\!3 and \}\!