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.

[Q]: [[51, -183, -71, 96, -4, -35], [-117, -140, -14, 94, 71]]
[A]: [96, 94]


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


[Q]: [[-45, 73, -28, 60, -196], [10, 9], [-56, -131, -81, -18, -43, -3, -103]]
[A]:
[73, 10, -3]