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.

[[-28, -118, -156, -57, -161], [-29, -157, -63, 77]]
[-28, 77]

[[-197, -160, 33, -161, 21, -115, -84], [34, -39, 11, -12], [-187, 68, -189, -24, -72, -19, -28], [-13, -17]]
[33, 34, 68, -13]

[[-200, 44, 64, 40, -48, -112], [32, -189, -180, -45], [-171, -163, -174, -180, -179], [-63, -150, -145, 100, -172, 97, 19], [36, -32, -98, -51, 27, -89], [-60, -153, 53, -174, -8]]

[64, 32, -163, 100, 36, 53]