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.

[[-6, 41, -190], [-47, 89], [29, -17, -135]]
[41, 89, 29]

[[83, -95, 37, -7], [33, -23, -133, -134, 77], [52, -161, 1, 34, -123, -29], [-130, 51, 97, -29], [-14, 36, -88, 49, -199]]
[83, 77, 52, 97, 49]

[[-83, 75, -166, -186, -112, 19], [24, 33, -68, -42, -11], [-57, -30], [29, 90, -199], [-183, 53, -162, 35, -144], [69, 62, 12], [68, -35, -191, -174, 73, -83, 75]]

[75, 33, -30, 90, 53, 69, 75]