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]

[[72, 43, 37, -195], [-123, -22, -117, -33, 67, 77, -163], [-198, -176, -16, 22, 44, 74, -90], [-10, -191, 5, 24, -69], [-168, -177], [-8, -173, -17], [-195, -46, 64, 15], [0, 59, -25, -95, -22], [45, -104, -59, -136]]
[72, 77, 74, 24, -168, -8, 64, 59, 45]

[[13, 26, -49, -174, -90], [-134, 28, -150], [-104, 31, 50], [-49, 12, 43, 23, 9], [11, 34, -57, -72, 78, -71]]

[26, 28, 50, 43, 78]