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.

[[-7, 38, 91, -146, -16, -169], [48, -155, 86, -44, 100, -92, 31], [-114, -7, -28, 51, 86, -4, 76], [84, 82, 71], [13, 2], [22, 53, -152], [-32, -137, -157], [-55, 14, -129, -58, 54, -10]]
[91, 100, 86, 84, 13, 53, -32, 54]

[[40, -40, -148, -172], [-116, -46, 92, -51, -20], [-161, -93, 46, -56], [3, -153, 79, -38, 62, -57]]
[40, 92, 46, 79]

[[-176, -132, 88, -72, -146], [-52, 21, -77, -15], [45, -51, -137, -109, -102, 19], [72, -165, -153, -169, 23, -90], [24, 60, -26, -88], [86, -192, 23, -199, -64, -180, 61], [-19, -79, -121, -151, -186], [-153, -65, 13, 2]]

[88, 21, 45, 72, 60, 86, -19, 13]