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.

[[-88, -73, 65, 51, -100], [-75, -195], [-115, 4, -152, -151, -65, 95, 85]]
[65, -75, 95]

[[-107, -152, -105, -113], [49, 56, 97, 94, -30, -19], [-56, 59, -97, -152, -86], [80, -119, -150, -199, -81, 22, -141], [-97, -110, -47], [-51, -65, -55], [-51, 9, -111, -14, -103, -59, -159], [-7, 64, 49, 70, -25, -49, -133], [-166, -40, -191, 81, 41]]
[-105, 97, 59, 80, -47, -51, 9, 70, 81]

[[-46, -198, 17, -181, -175, 21, -98], [68, -95, -97, 65, 30, -42], [-158, -148, -163, -117, 97, 27, -93]]

[21, 68, 97]