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.

[[-91, 65, -182, -89, -129, 10, 64], [-65, 7, 2, 67, -160], [-176, -15, -177, 98, -49, -7], [-138, 46, -133, -190, -46, -187, 47], [76, 14, 42, -105, -142, -54], [-168, -16, -105, -95], [-148, 44, -18, 91, 23, -38], [56, 64, -189, -50]]
[65, 67, 98, 47, 76, -16, 91, 64]

[[-161, -60, -171, -26, -39], [-31, -68, 0, -4], [-171, 75]]
[-26, 0, 75]

[[-90, 80, -67, 38, -52, 34, -195], [-168, -37, -65, -184, 42], [-150, -183, -149], [-171, -150, -19, 0], [-95, -48, -51, -188], [-9, -5, -8, 91, 92, -163, -139]]

[80, 42, -149, 0, -48, 92]