(defvar A (LIST 'A 'B 'C 'D 'E 'F 'G 'H 'I 'J 'K 'L 'M 'N 'O 'P 'Q 'R 'S 'T 'U 'V 'W 'X 'Y 'Z))
(defvar B (LIST '\. '\, '\! '\$ '\& '\{ '\} '\°))
(defvar C (LIST 0 1 2 3 4 5 6 7 8 9))

(defun G (L Z)
        (setf Z (1- Z))
        (cond ((plusp Z)(G (CDR L) Z))(T (CAR L)))
);i <3 recursion!

(format t "~D~D~D~D~D~D~D~D~D~D ~D~D~D~D~D~D~D~D~D~D~%"
        (G A (* (G C 8) (CADDR C)))
        (+ (G C 3) (G C 3))
        (/ (+ (G C 10) 7) (G C 3))
        (G B (G C 9))
        (GCD (G C 5) (G C 9))
        (- (CADDDR C) (CADDDR C))
        (G B (- (CADDDR C)(CADDR C)))
        (- (GCD (CADR C) (G C 6)) 1)
        (+ (CAR C) (- (CAR C) (CAR C)))
        (+ (CAR C) (CADR C))
        (G A (G C 6))
        (- (/ (CADDDR C) (CADDDR C)) 1)
        (* 2 (CADDR C) 2)
        (G B (G C 9))
        (ROUND (SQRT (- (* (G C 10) (G C 4)) (G C 3))))
        (/ (* (G C 5) 10) (G C 6))
        (G B (- (CADDDR C)(CADDR C)))
        (* (+ (CADR C) (CADDR C)) (CADDDR C))
        (- (G C 9) (+ (G C 2) (G C 3)))
        (LCM (CADDR C) (+ (G C 2) (- (G C 9) (G C 4))))
)