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.

[[61, -35, -161], [-87, 73], [-82, 78, -19, -170], [-169, -132, 71], [-99, -136, -127], [88, -173, 0, 74, -8, 73], [-111, -164, -30]]
[61, 73, 78, 71, -99, 88, -30]

[[37, 63, 24, -49, -66, 81], [-36, -61, -108], [35, -115], [-24, -143, 65, -63], [-104, 59, -120, -187, 27, -102, 36], [-105, -31, -128, -167, -109], [32, -148, -76, 33, -190, -89], [47, -56, 89, -35, -137, -2, 43], [98, 11, 48, -66, -84, -60]]
[81, -36, 35, 65, 59, -31, 33, 89, 98]

[[-192, -183, -114], [20, -68, 26], [-35, 90], [-26, -56, -132, 15, 17, -57, -171], [-62, 100, 82, -112, -35], [-119, -181, -140, 12], [-91, 22, -57, -50], [-125, -149, -44, -95, -39], [-196, -43, 34, -185]]

[-114, 26, 90, 17, 100, 12, 22, -39, 34]