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.

[[76, -10, 56], [-177, -39, -40, 29, -17], [17, 77, 94, 58, 88, 39], [-2, 94, -166, -183, -48]]
[76, 29, 94, 94]

[[-124, -72, 94], [40, -5, -15, -98, 79, -94, -45], [53, -40, -73, -117, -195, -50], [20, 51, -140], [-30, -112, 25, 35, 84], [-40, -135, -184, -159, -33, -59]]
[94, 79, 53, 51, 84, -33]

[[-23, -131, 15, 90, 1, -136, 22], [76, -117], [-186, -135, -168], [-5, -101, -144, -98, -14]]

[90, 76, -135, -5]