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.

[[-56, -179, -2, -94], [-5, 31, -137, -128], [-53, -151, -60, 57, -3], [-73, 0, -54, -128], [6, -74, 55, -90], [94, -128, 94, 44, -189, -38], [-167, -129, -11, 49, -60, -66], [-123, -3, 57, -159], [-120, -178, -46, -190, -26, 9, -8]]
[-2, 31, 57, 0, 55, 94, 49, 57, 9]

[[-36, -152, -104, -52, 52, 6], [90, -19, -71, -183, -183, -15, -153]]
[52, 90]

[[-87, -28, 65, -178, -32, -71], [-50, 47, -82, 40, 51], [47, -6, -37, -6, -179, -57, 88], [79, -132, 67, -97]]

[65, 51, 88, 79]