instruction:
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.
question:
[[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]]
answer:
[67, 85, 90, 76, 81, 98, 94]


question:
[[69, -92, -181, 13, 31, -185], [-14, -145, -116, 13, -132, 90, 0], [-188, -25, -182, -101, 14]]
answer:
[69, 90, 14]


question:
[[65, -57, 8, -30, -95], [-27, -56, -163, -192, -155], [-164, 94, -93], [-6, -141, -18, -45, -111, 16, -77], [49, -148, -150, -50]]
answer:

[65, -27, 94, 16, 49]