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.

[[-79, 48, -148], [-119, -87], [-60, 96, -89, -162], [-171, 8, 54], [16, -66, 91, -22, 4, 39, -60], [58, -143, -29], [-24, -23]]
[48, -87, 96, 54, 91, 58, -23]

[[-15, 9, -181, -172, -74], [-164, -77, 1, -65, 29, -113, -163], [-189, -106, 22, -40, -50, -48], [-77, -61, 16, 85, 36, -45, -26], [2, 77, -77], [-146, -87, 75, -163, -147]]
[9, 29, 22, 85, 77, 75]

[[-60, -15, -145, -17, -184, -199], [-146, -105, 64, -192, -170, 17, 69]]

[-15, 69]