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.

[[-121, -195, -57], [44, 95, -149, -20, -116, -41], [-37, -154, -161, 65, 25, -112], [-186, -114, -1, -85], [54, 11, -124, 22, 100, 54], [-140, 55, -133, -35, -3], [-54, -158, -194, -191, 31], [94, -27, 78, -132, -132, 52, -170]]
[-57, 95, 65, -1, 100, 55, 31, 94]

[[-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]

[[-73, 23, -27, -80, -99], [-98, -42, 16, -59, -48, 13, -62], [-104, -69, -26, 95, -200], [81, -156, -21, -83, 2, -108], [77, -140, -16, 17, -182, -74, -120], [76, -116], [-196, 73, -100, -102, -84, -193, 38], [-92, 98, -91, -164], [-103, -32, 26, -22, -161]]

[23, 16, 95, 81, 77, 76, 73, 98, 26]