The most readable approach to me would be to be able to write:
(setq _BAMOFO (fullname result))
And you need to define a fullname accessor function.
Then you do not really care about how it is implemented; nth is quite readable in my opinion.
(defun fullname (list)
(nth 0 (nth 1 list)))
Or maybe you can find a more robust way to extract the name given the shape of your data, for example finding out the list that follows the list that contains "FullName", that's not entirely clear to me if that makes sense in your context.