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.

[[99, -128, -21, -121, -117, -92], [-48, -9, -141, -18, -95], [-20, -29, -22, -193]]
[99, -9, -20]

[[-91, 65, -182, -89, -129, 10, 64], [-65, 7, 2, 67, -160], [-176, -15, -177, 98, -49, -7], [-138, 46, -133, -190, -46, -187, 47], [76, 14, 42, -105, -142, -54], [-168, -16, -105, -95], [-148, 44, -18, 91, 23, -38], [56, 64, -189, -50]]
[65, 67, 98, 47, 76, -16, 91, 64]

[[64, -44, -126], [62, -99, 85, -103, -137, -79, -41], [-168, -129, -124], [-86, -94, 25, -171, -75], [-195, 0, -10, 49], [-131, 81, 17, 31, 98, -59]]

[64, 85, -124, 25, 49, 98]