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.

[[50, -99, 52, -39, -139, 57, -66], [-50, 61, -23, -169, -153, -162, -81], [-165, -194, 36, -100, -200, -81], [-83, 78, -200, -49, -96]]
[57, 61, 36, 78]

[[-124, -174, -30, -67], [44, -156, -76, 68, -145, -19, -178], [-18, -104, -19, -63, -15], [-99, 12, -129, 38, 4]]
[-30, 68, -15, 38]

[[-165, -195, -88, -9, -109], [10, -115, -24, -82], [11, -141, 5, -88], [90, -5, -45, -6, 43, -162, -74], [44, -139, -137, -50, -152, -152, 81], [51, -200, -40, -95], [32, 1, 91]]

[-9, 10, 11, 90, 81, 51, 91]