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.

[[-134, -48, 4, 24, 71, -187, -166], [44, 10, 44, -55], [-63, -29, 15, -89, 78, 63, -106], [-112, -11, -134, 87, -46], [-128, -93, 68, -87], [-147, -63, 91]]
[71, 44, 78, 87, 68, 91]

[[13, 57, -9, -14], [-52, -50], [-53, 99, -145, 13, 32], [-195, -147, -179, 6, 67], [-189, 54, -1, -111], [-152, -12, -169, 62], [-4, -134, -18, 7, -134, -66, -23]]
[57, -50, 99, 67, 54, 62, 7]

[[-75, -192, 23, 57, -71, -61], [-195, -145, 58], [-8, -95, 17, 97, -2, -50], [-109, 59, 4, -163], [4, -148, -154], [-54, -165, 52, 67, -193, 92], [70, -136, 76, -199, -76]]

[57, 58, 97, 59, 4, 92, 76]