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, -106, -178, 55], [-140, -84, -171, -91]]
[55, -84]

[[-190, -118, 52], [-118, -139, -176, 7, -164, -105, 8], [23, -133], [-158, 54, -118, -120], [-162, -147], [-154, -102, -134, -142, -141, -127, 61], [25, 7], [-151, -160, -44], [92, -66, -39, -131, -53, -166, 30]]
[52, 8, 23, 54, -147, 61, 25, -44, 92]

[[-176, 8, -69, -91, -73, -76, -84], [-152, -29], [-184, -192, -72, -78, 75, -43, -62], [79, -138, -136, -132], [-47, -45], [-33, -113], [-110, 84, -109, 33], [-156, 80, 7, -72, -119, 53, -199]]

[8, -29, 75, 79, -45, -33, 84, 80]