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.

[[97, -79, -195, 1, -45, -140], [-172, -37, -72], [70, 17, 83, -49]]
[97, -37, 83]

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

[[89, -127, -44, 15, -195], [-25, 7, 23, 20, -189, -92], [-13, -60, 48], [-106, -54, -9, 59], [33, 41, -108, -3, -119, 65], [-100, -126], [-199, 23]]

[89, 23, 48, 59, 65, -100, 23]