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:
[[-61, -130, -161, 8, -36, 53, -21], [-30, 55, -48, -10, -25, -183, -1], [-92, 93], [-144, -105, -78, 90, -32], [-87, -168, -25, 75, -48, -51, -86], [10, -17, 6]]
answer:
[53, 55, 93, 90, 75, 10]


question:
[[-60, -47], [0, -38, -83], [-199, -140, -188, -11, -82], [-84, -86, -6, -157, -11, 6, -43], [85, 34, -189, -52], [-50, 50, -191, -105]]
answer:
[-47, 0, -11, 6, 85, 50]


question:
[[-144, -116, -168, -126], [61, 0, -14, -37, -143, -27, -107], [-43, -142], [99, 80, -10, -14, -193, 12, -157], [-91, -120, -178], [-72, -71, 99, -97, -28, -182, -76], [-200, -182, -19, -129, -42, -92, -84], [-14, -60, -71], [14, -154, 46, 48, 88]]
answer:

[-116, 61, -43, 99, -91, 99, -19, -14, 88]