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.

[[-119, 97, 45, 19, -111, -13, -181], [-74, 23, -81, -96, -51, -14]]
[97, 23]

[[94, -71, -83, -154, -126, -62, -104], [-168, 66, 9, -12]]
[94, 66]

[[4, -123, -136, -24], [-132, -75, 93], [-162, -19], [-2, -96, 43, 5, -32, -50, -193], [-194, -61, -25, -105, -23, 34], [-114, -135, -81, -27], [100, -98, -195], [51, -51, -135, -157, -156, -13, -172]]

[4, 93, -19, 43, 34, -27, 100, 51]