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.

[[-105, 91, -50, 93, -119, -108], [-190, -161, -97, -149, -13, 57], [-138, -124, -182, 20, -75, 98, -127], [-200, -188, -102, -171, -179, 60, 29], [-69, -87, 15, -52], [-177, -147, -64], [-147, -198, -141, -67, -9, -135, -106]]
[93, 57, 98, 60, 15, -64, -9]

[[-164, 47, -194, 68, -157, -197], [-104, -30, 57, -31], [-125, 94, -188], [3, -100, -5, -114], [88, -193, 36], [34, -122]]
[68, 57, 94, 3, 88, 34]

[[-44, -88, -134, -89, -187, 59], [-23, -80, 32, -168, -2], [-109, -119, -173, -15, -164]]

[59, 32, -15]