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.

[[-170, -186, -15], [-130, -93, -50, 88, -170], [-15, -144, -141], [-85, -104, -115]]
[-15, 88, -15, -85]

[[10, -121, -54, -1, -69, -181], [83, -37, -173, -81, -42], [-117, 86, -6, -54, -21], [-171, 22, -69]]
[10, 83, 86, 22]

[[74, -86, 58, -6, -24, -138], [-166, -178, -47, 21], [37, -81, 26], [-91, 5, 86, -155, 86, -151, -47], [-94, 2, -91, -71], [-15, -133, 75, -139], [-63, -119, -50, 76, -45], [-164, 27, 24]]

[74, 21, 37, 86, 2, 75, 76, 27]