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.
[[96, -151, -66, -130, 28, 38, -122], [24, -197, 44, -150, 18, 77, -79], [-198, -106, 18], [-170, 81, -159, -125, -47], [88, 39, -155, -72], [60, -147, -35, -126, -46, -165], [51, -125, -11, -157, -112, -14]]