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.

[[97, -186, -18], [-4, -71, 23, -142, -52], [-49, -2, -172, -169, -114, -200], [58, 61, -30, -27, -87, -163, -9], [-146, 62, -26, 6, -98], [-5, 3, -63, 68, -158], [-162, 9, 12, -187], [-189, 15, -195]]
[97, 23, -2, 61, 62, 68, 12, 15]

[[-97, -84], [-75, -51, 27, 64, -149, -46], [1, 62], [-8, -1, -122, -47], [-178, 88, 63, -49, -82, -1, -90], [-138, -192, -122, -71, -112]]
[-84, 64, 62, -1, 88, -71]

[[39, -160, 49, -192], [-6, -133, -98, 39, -118, -108], [-138, -14, -164, 95]]

[49, 39, 95]