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.

[[-12, 25, 90, -161, -90, -10, -71], [5, -63, -36, 98, -7], [20, -168, 22, -198], [-89, 83, -185, -69, -110, 85], [-7, -27, 3, 64, -132, 36, -40], [37, 68, 77, -51], [-143, 48, -53, 6, 63, 58], [-162, -152]]
[90, 98, 22, 85, 64, 77, 63, -152]

[[62, 99, 64, 0, 34, -52, 11], [-53, 32, -147, 29, -84, -116]]
[99, 32]

[[-4, 41, 76, -12, -44, 9], [-16, -129], [-124, 30, 84, -124, -136], [-30, 82, -199, 8], [-108, -91, -115, -38]]

[76, -16, 84, 82, -38]