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.

[[-110, 98, -104, -154, -75, -61], [-194, 43, -85, 79, -95], [-112, -183, -70, 97], [-95, 65, -100, -127], [-185, 71, -108, -93, -1], [-48, -114, -149, 43, -101], [-72, -135, -135, -137]]
[98, 79, 97, 65, 71, 43, -72]

[[86, -199], [-148, -11, -34, -90, 76, -18], [-100, -108], [-79, -3, -49, 99, -130, -45], [27, -26, -37, -37, -100, -132, -169], [-160, -115, -48, -107]]
[86, 76, -100, 99, 27, -48]

[[-55, -126, -3, -2, -191, -81], [7, -116, 9, 34], [66, -158, 27, 41, -78, -62], [80, -24, 84, -143, 60, 87], [-56, -170, -154, -178], [52, -191, -103, 50, 7, -69, 85], [-194, -150, 6, -183, -195, -136], [-160, -16, -3]]

[-2, 34, 66, 87, -56, 85, 6, -3]