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:
[[-128, -182, 21, -87, -194, -165, -9], [-64, -106, -38, -182, -45, -81], [-49, -197, -76, 99, 91], [89, -158, -186, -149], [40, -165, -148, -52, -153, -159], [-61, -69, -139, -1, 23, 0, 46], [69, -133, -27, -135]]
answer:
[21, -38, 99, 89, 40, 46, 69]


question:
[[-53, -85, 38, -82, 24, -165], [7, -123, -175, -193, 66, -76, -109]]
answer:
[38, 66]


question:
[[21, -8, 73, 90, 57], [-105, 44], [-80, -2, -180, -178, 83], [-198, 16, -77, -72, 15, -140], [-35, 95, 14], [-108, -4, 46, 98, -183], [-160, -92, 76, -43], [-117, -196, -42, -113]]
answer:

[90, 44, 83, 16, 95, 98, 76, -42]