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.

[[53, -34, -71, -43, -141, -174, -73], [5, -80, -181, -140, -63, -86, 34], [-86, -1, 91, 15, -191], [-171, 1, -62, 9, -161, 40, 35]]
[53, 34, 91, 40]

[[78, -23, -113, -137, 21, 71], [-195, 80], [-169, 20, 35, -101, 91, -78], [-174, 31, -169, -18, -159, 99, -7]]
[78, 80, 91, 99]

[[-177, 15, -126, -128, 3], [-8, 65], [-76, -65, -186, -112, -13, -105], [-104, -5, -131, -180, -117, -46], [-157, -123, 39, -131, -99], [-186, -130, 89], [-187, -177]]

[15, 65, -13, -5, 39, 89, -177]