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.

[[97, 4, -169, -58, 19], [-124, -24, 25, -83, -178], [-20, 45], [-181, 51], [-124, -113, -154, -181, -175], [-150, -93, -196, -56], [-69, 41], [-171, -40], [74, 19, -17]]
[97, 25, 45, 51, -113, -56, 41, -40, 74]

[[51, 10, -181, -96], [-40, 69, 46, -116, 53], [-135, 92], [-151, 35, -65, 52], [23, -125, 82, 57, -57], [-185, -94, -73, -131, -191, 70, -154], [9, 65, 41]]
[51, 69, 92, 52, 82, 70, 65]

[[-39, -143], [-66, -67, -172, 8, -32, -47, -56], [-72, -75], [37, -150, 49, -146], [-155, 59, -152, -158, -195, -185, -76]]

[-39, 8, -72, 49, 59]