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.

[[-35, 83, -145, -47, -160, -105], [-174, -29, 64, -182, 87, 53, -148], [8, -178, 46, 54], [-46, -140, -18], [-42, 51, -72], [-61, -17, -13, -52, -161]]
[83, 87, 54, -18, 51, -13]

[[-148, 31, -194, 43, -103, -187, -150], [10, -3, 85, -57], [-102, 39, -179, -125, 49]]
[43, 85, 49]

[[46, -147, -48], [-55, -70, 9, -182, -136], [15, 88, -56], [-120, -85, 70, -185], [-49, 82, -138, -10], [-8, -21, 41, 41, 79, -125, 100], [91, -109], [-188, 65, -123, -17]]

[46, 9, 88, 70, 82, 100, 91, 65]