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:
[[-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:
[[-184, -9, -39, 19, -2], [-122, -141, -96, -147], [-100, -186, 60, 52], [43, 38, -18, -20, -150, -40, 50], [63, -70, -158], [58, 38, 42, -13, -61, 30, -129], [1, 92, -75, 2, -7, -88], [-63, -192, -194, 44, 67, 20, -100]]
answer:
[19, -96, 60, 50, 63, 58, 92, 67]


question:
[[88, 37, -26, -185, -36, 8, -105], [99, -150, -165], [90, -170, -94, 91], [44, -198, -29, -135, -36], [-45, -17, -174, 99, -119, -164], [-73, -14], [-126, -19, 27, -119, -62], [35, 11, -18, -90], [-145, -127, 86, 7, -49, -95, -168]]
answer:

[88, 99, 91, 44, 99, -14, 27, 35, 86]