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.
[[36, -17, -53, -125, 25, 78], [-121, 86, -9, 16, 22, 36], [61, -99], [-55, -38], [70, 6, -125, -194, 30], [-10, -62, -22], [83, -172, -107, -19], [86, 88, -93], [-101, -11, -19, -101, -21, 28, -168]]