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.

[[-73, 37, -21, -114, -70, -143, -15], [-28, -38, 32, -102], [-192, -47, 34, -51, -69, 1, -118], [-161, -3, -23], [-176, -187, 97, -134], [97, -175], [61, -159, -108, -179, 68]]
[37, 32, 34, -3, 97, 97, 68]

[[-168, -52], [-183, 2, -104, 24, -153, -56], [25, 78, -118, -28, -39, -12], [97, 95, 12, -21, 82]]
[-52, 24, 78, 97]

[[-89, -51, -96, -182], [16, -27], [73, -118], [-84, 54, 99], [-73, -68, -52, 56, -48, 10], [-37, -144, -106, 69]]

[-51, 16, 73, 99, 56, 69]