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.

[[72, -172, -132, 93], [-200, -74, -56, -40, -68, -163, -58], [-72, -164], [-166, -70, -127, -16, -41, -121, 13], [-56, 91], [-181, 35, -12, -99, -122], [-66, 33], [18, -141, -40, 28, -175, -102, -63]]
[93, -40, -72, 13, 91, 35, 33, 28]

[[-161, -49, -6], [36, -84], [-53, 29, 2, -167, -111], [-163, -46], [-41, -91], [-71, 29, 35, -187, -53, -196, -66]]
[-6, 36, 29, -46, -41, 35]

[[28, 97, 80, -6, -24, 80, -129], [71, -161, 32, -189, 7, -140, -156], [2, 12, 44, 65, -10, 69, -121], [100, -52, -116, -174, -130, 82], [-101, -49, -35, -23, -101, -86], [-135, 32], [-199, -161], [34, 30, 68, -51, -162], [-78, -176]]

[97, 71, 69, 100, -23, 32, -161, 68, -78]