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.
[[-125, 17, 51, -184], [6, -191, -44, -68, 28], [-30, 32, 79, -101, -152, -77, -163], [-86, -165], [-185, 8, -122, -24, -199], [-150, -147], [-133, -100, -88, -194, 53]]