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.

[[13, 57, -9, -14], [-52, -50], [-53, 99, -145, 13, 32], [-195, -147, -179, 6, 67], [-189, 54, -1, -111], [-152, -12, -169, 62], [-4, -134, -18, 7, -134, -66, -23]]
[57, -50, 99, 67, 54, 62, 7]

[[53, -34, -71, -43, -141, -174, -73], [5, -80, -181, -140, -63, -86, 34], [-86, -1, 91, 15, -191], [-171, 1, -62, 9, -161, 40, 35]]
[53, 34, 91, 40]

[[-183, -82, -91, -38, -84, 99], [-72, 3, -157, 73, 55], [-178, -103, -15], [-103, 33, -23], [-44, -104, -195, 65, -199], [-109, -74], [9, -36, 63, -16, 3, -146, 26], [10, -135, -175, 86, 97, 37]]

[99, 73, -15, 33, 65, -74, 63, 97]