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:
[[-171, -189, -135, -121], [-84, 53, -190, -121, 80], [-5, -124, 98], [-99, 55, -157, 56, -18, -141, -178], [-17, -34, -82, -186], [-134, 10], [55, -124, -200, -24, -77]]
answer:
[-121, 80, 98, 56, -17, 10, 55]


question:
[[-50, -43], [8, -108, 3, 41, 100, -103], [-171, 61, -67, -75, -58, 47], [0, 82, -166, -101, 66], [-65, -87, -28, -194], [42, -162, 15, 39, -11, -126]]
answer:
[-43, 100, 61, 82, -28, 42]


question:
[[-154, -69], [-132, -66, -156], [93, -31, 60, -40, -183, 100], [-197, -4, 32], [-92, -196, -128, -136, -42, 19], [-81, -15, 66, 88, -154, -182], [0, -35, 93, -71, 55], [65, 66, -172, 26, -129, 94, -25], [-99, -89, 51, -32, -94, -10]]
answer:

[-69, -66, 100, 32, 19, 88, 93, 94, 51]