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.

[[51, -67, -81, -30, 67, -10, -110], [-187, 85], [-127, -137, -194, 90, -185, -149, -163], [-54, -34, -105, -77, -65, 76], [-121, 81, -112, -28], [-65, 97, 98], [8, -183, 72, -81, 15, 94, 32]]
[67, 85, 90, 76, 81, 98, 94]

[[76, -10, 56], [-177, -39, -40, 29, -17], [17, 77, 94, 58, 88, 39], [-2, 94, -166, -183, -48]]
[76, 29, 94, 94]

[[8, 65, -152, 54], [-122, -41, -90, -30, -4, -148, -31], [-13, 77, -81, -14, -163], [-52, -22, -37, -132, -133, -60, -131], [-39, -162, -63, -92, -96, 5, -65]]

[65, -4, 77, -22, 5]