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.
[[-136, 68, -87, -44, -80, -98], [-45, -138, -149, -151], [-34, -146, 26, -135, -175], [-69, -53, 97], [-194, 24, 28, 6, -73, -59], [-89, -119, -7, -96, -1, -26], [63, 97, -157, -33, -135], [-25, -194], [-39, -23, -196, -190, 93, 20, -138]]