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.

[[9, -188, -167, -47], [-72, -97, -152, -108, -49, -5], [-88, -84, 26, -11, -91, -46, 62], [-110, -35, -61, -141, -182], [52, 29, 92, -131, -121, -98, -35], [-30, -125, -175, -123, -45], [91, -16, -57]]
[9, -5, 62, -35, 92, -30, 91]

[[99, 11, 61, -95], [-186, -124, -20, -125], [-50, 93, -17], [-165, 56, 52, -142], [-88, -46, -178, -37, -126, 24], [84, 100, 18, 71, -135, 44, 96]]
[99, -20, 93, 56, 24, 100]

[[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]]

[36, 42, 66, 54, 60, 9, -93, 76, 51]