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.

[[-20, -79, 59, 63, -135, -96, -190], [-42, -144, -87, -33], [-109, -128, 25, 43, -50], [49, 68, -161, -180]]
[63, -33, 43, 68]

[[-80, -194], [-27, -106, -119], [-185, -153, -114]]
[-80, -27, -114]

[[-176, -188, -117, 16, -93, 50, -111], [98, -7, -34, -98, -146], [-109, 48, -100], [-170, 22, -50, -178, 49, 22, -88], [-105, 69, -146, -138], [-28, -85, -114, 12, -39, 71], [1, 69, -14, 78, -61], [-195, -145], [-10, -174, 10, 45, 53]]

[50, 98, 48, 49, 69, 71, 78, -145, 53]