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.

[[5, 20], [36, -36, -177, -145], [90, -26, -6, 12, 94]]
[20, 36, 94]

[[-190, 12, -59, 9, 100, 83], [-187, 40, 97, 8, -29], [77, -190], [-153, 11], [17, -89, -75, 52, -112, -52, 51], [-60, -103, -79, 74], [-86, -4, 55, 99], [-69, -25, -52], [8, -62]]
[100, 97, 77, 11, 52, 74, 99, -25, 8]

[[95, -157, 53, 5, -43, 24, -165], [69, -164, -30, -167, -149, -185], [2, 74, 61, -166, -23, -125, -98], [100, 62, -47, -180], [38, -107, 33, -99, -109]]

[95, 69, 74, 100, 38]