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.

[[34, -28, -82, 73, -107, -173], [-23, -123, -142, 26, -22, -200, -131], [-142, -55, -194, 81, -194, -19, -19], [-53, -97, 48, -30, -189, -9, -22], [-117, 31, -8, -83], [25, -11], [34, -163, -82, 44, -43, 16], [-124, -84, 31, 10, 30]]
[73, 26, 81, 48, 31, 25, 44, 31]

[[10, -121, -54, -1, -69, -181], [83, -37, -173, -81, -42], [-117, 86, -6, -54, -21], [-171, 22, -69]]
[10, 83, 86, 22]

[[-194, -183, 48, -40, -101, 23], [-114, -94, 65, 4, 30], [82, -57], [-196, 98, 49, 5, 13, 24], [22, -167, -126, -31]]

[48, 65, 82, 98, 22]