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.

[[-59, 44, -29], [-168, -64, -74, 51, -166], [-22, -130, -9, -67, -98, 46, -114]]
[44, 51, 46]

[[13, 57, -9, -14], [-52, -50], [-53, 99, -145, 13, 32], [-195, -147, -179, 6, 67], [-189, 54, -1, -111], [-152, -12, -169, 62], [-4, -134, -18, 7, -134, -66, -23]]
[57, -50, 99, 67, 54, 62, 7]

[[-21, -41, 100, 3, -56, -3], [-188, -125, -73, -28, -44, 83, -62], [55, 46], [74, 7], [33, -122, -59], [-60, -182, -164, 63, 72, -106, -188], [-114, -124, 6, -90, -189, -5, -5], [-171, -56], [6, -148, -54, -37]]

[100, 83, 55, 74, 33, 72, 6, -56, 6]