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.

[[-79, -50, -49, 57, -110, -78, -180], [-119, -90, 40], [81, -55, -64, -19], [17, -42, -76, -136, -58], [-74, 4, -161, -72]]
[57, 40, 81, 17, 4]

[[-79, -105, 14, 41, -10, 26], [-96, -44, -191], [19, 34], [-56, -50, -39, -94, 79, 86], [-137, -145, -74, 26, -54, -172]]
[41, -44, 34, 86, 26]

[[90, 8, -21], [37, 98], [20, -144, 46, 19, -148, -166, -26], [-16, 59, -178, 97], [-10, -187, -97, -144, -189, -45, -172], [-157, 89, -76, 15], [-74, 14, -49, -85, -13, -111, -35], [-130, 55, -2, 76], [97, -129, 84, 100]]

[90, 98, 46, 97, -10, 89, 14, 76, 100]