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.

[[-117, -166, 78, 98, 72, -44, -59], [-181, 57, -154, -50, -195, -14], [-73, -73, -10, -118, -7, -121, 95], [99, 66], [68, -97, -20, 87, 67], [76, -170, 56, 32, -95, 41]]
[98, 57, 95, 99, 87, 76]

[[53, -110, 46, -100, -61, -121], [-108, -24, -6, -175, 41, -41], [-184, 80, 24], [-159, -54, 91, 38, -145, 40, 98], [-92, -87, 36, 91], [-33, -199, 62]]
[53, 41, 80, 98, 91, 62]

[[-199, -31, 26], [67, 35, 70, -1, 30, 57, 14], [9, -108, 0, -184, -35], [50, 50, -64, -183], [-29, -51, -34, -198, 3, 67, -188]]

[26, 70, 9, 50, 67]