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.

[[-75, 10, -138, -42, 85, 8, -74], [18, 10, -70, 74, -88, -117, -145], [65, -145, 24, -193, -120, -186, -14], [-172, -115, -146], [-87, -180, -38, 77], [91, -50, -12, -23, -38, -89, 71], [-58, 81, -175], [-197, -145, 57, 94, -78, -184, -133], [-50, -183, -127, -77, 41]]
[85, 74, 65, -115, 77, 91, 81, 94, 41]

[[-113, 36, -122, -72, -47], [-168, -23], [76, 65, -142], [-181, 20]]
[36, -23, 76, 20]

[[80, -16, -74], [-199, 10, 5], [9, 77, -197, 38, -177, 26], [-118, -38], [96, -60, -184, 3, 26, 74], [-196, 67, 91, -127, 27, -127, -26], [-101, 35], [70, -95, -96, -41]]

[80, 10, 77, -38, 96, 91, 35, 70]