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.
[[-35, -149, -171, -13], [-125, -189, -3, 36, -39, -192, -87], [-104, -20, -27, 89, -127, 23, -31], [86, -26], [15, -194, -198, -106, -168, 39], [-49, -9], [46, 48, -50, -33, -172]]