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:
[[98, -52, -91, -43, -31], [-140, 30, -153, -111, 2, -127], [-45, 96, 67, 56, 72, 10], [87, -89], [-95, -164, -61, 63, 96, -105], [-75, -179, 22, 67, -98], [-121, -25, 53, -174]]
answer:
[98, 30, 96, 87, 96, 67, 53]


question:
[[-67, 92, 59, -49, -22, -8], [-65, 28, -120, -118, -63, -19, -160], [10, 46, -37, 65, -184, 99, 52], [-18, 15, 6]]
answer:
[92, 28, 99, 15]


question:
[[86, 75, 15, -175, 7], [-97, -175], [50, 40, -187, -156], [-182, 7, -190], [-135, -60, 21], [-172, -157], [46, -2, -34, -26, -50, 38, -179], [69, 28, 32, 34]]
answer:

[86, -97, 50, 7, 21, -157, 46, 69]