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.

[[15, -109, -144], [-76, 24, -172]]
[15, 24]

[[-111, -54, -11, -97, -137, 82], [63, -197, 31]]
[82, 63]

[[76, -199, -159, -115, 45, 36], [-134, -69, -91, -51], [-33, -78, 81, -104, 71], [84, -46, -99, -98, 15, -40], [56, -36, 24, -168, -47, 38, -89], [14, -189, 44, -72, 97, -175], [-82, 4, 58, -199, -95, -167, 35]]

[76, -51, 81, 84, 56, 97, 58]