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.
[[-146, -191, -28, 86], [21, 28], [46, -180, 48, 41, -136], [85, -68, -94, 9, -18, -200], [98, 35, -25, -21, -151, -50], [51, -38, -153, 48, -168, -87, 79], [-136, -153, 51, -152, 17, -87], [32, -119, 92, 11]]