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, 10, -157], [42, -167, 4], [-158, -57, -148, 66, -112, -137, 32], [-71, -40, 22, 54, -112], [-52, -37, 57, 60, -52, 47, 53], [9, -41, -79, -87], [-93, -131, -180, -181, -154, -95], [-143, 23, -90, -23, 76, -63, -106], [51, -8, -85, -192]]