In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[62, -50, 50, -171, -123, -66, 8], [-121, -142, -148, -168, -40], [-131, -184, -81, -17, -149, -35, 92], [-23, 19, -168], [63, -118, -28, 86]]