Modify Lists scheme

how would I write a function in scheme that takes a nested list as an argument and returns a list of lists. For example if I gave it ( ((1 2 3) (2 3 4) (3 4 5)) (4 5 6) (5 6 7) (8 9 10)) ) it would return  ( (1 2 3) (2 3 4) (3 4 5) (4 5 6) (5 6 7) (8 9 10)  )

It takes a certain special flavor of stupid to ask /prog/ to do your homework.

This isnt homework, im a working on a project Euler question and need this to find a solution

(define (tree->alist tree)
  (cond ((null? tree) '())
        ((alist? (car tree))
         (append (car tree) (tree->alist (cdr tree))))
        (else (cons (car tree) (tree->alist (cdr tree))))))

(define (alist? obj)
  (cond ((null? obj) #t)
        ((not (list? (car obj))) #f)
        (else (alist? (cdr obj)))))

car