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.

[[-53, 27, -29, 53, -93], [-148, -197]]
[53, -148]

[[-8, -195, -141, -165, -183, -5], [88, -22, -176], [93, 47, 11], [-2, -178, -76, -118, -193, -39], [-98, 22, -150, 67, -158, -133, -61], [72, -124, 63, -187, -45], [-193, -85, -48, -49, -17], [-119, 27, -119, -146, -50]]
[-5, 88, 93, -2, 67, 72, -17, 27]

[[-92, -24, -6, -109, -141], [-106, -166, 83, -174, 59, 67], [-175, 56, -50]]

[-6, 83, 56]