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.

[[96, -52, 68, -142], [-73, -61, -136, -199, 2], [-76, -160, -80, -125, -52, 19], [59, -116, -112, -40, -22], [-16, 43], [-187, 28, -125, -154, -93, -133, 38], [-46, -200, -124, -158]]
[96, 2, 19, 59, 43, 38, -46]

[[-58, -176, 95, -113, 67, -164], [97, 98, -87, 68], [57, 21, 86]]
[95, 98, 86]

[[-16, -112, -76, -56, 59, -157, -84], [-63, -69], [-24, 74, 85, 99], [-117, -193], [97, -108, 60, 56, 24, -2], [-54, -164, -61, 76, 90]]

[59, -63, 99, -117, 97, 90]