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.

[[98, -19, 52, 95, -164, 7], [-95, -171, 56, -150, -169, -116], [93, -89], [13, -56], [-93, 28, -3, -74], [59, -28, -111, -174], [-110, -135, 74, -109]]
[98, 56, 93, 13, 28, 59, 74]

[[-12, 54, 78, -136, -49, 2], [-26, 86, 45, -195], [-169, -89, -72], [-153, -194]]
[78, 86, -72, -153]

[[-33, -56, 79, 66, 6, -192, -10], [-163, -200, 89, 71, 66]]

[79, 89]