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.

[[-82, 59, 16, -170, -136, 39], [-40, -166, -55, 98, 96], [87, 75, 43, 27, -133], [-70, -62, 32, 79, -66, -138, 43]]
[59, 98, 87, 79]

[[-105, -189, 19, -65, -189, -88, -117], [39, 62], [44, -144]]
[19, 62, 44]

[[2, 34, -101, 57, -155], [-192, -72, 56, 23, -68], [-126, -44, -88, 49, -47, 10, -156], [93, 44, -86], [32, -14, -90, -7, -196, 81], [76, -143, 84, 39], [-47, -167, -27, -92, -75, 53], [6, 13, 47, -123, -196, -110, -64], [-143, 60, 65, -134]]

[57, 56, 49, 93, 81, 84, 53, 47, 65]