Циклическая перестановка N следующих подряд элементов в списке

(defun cycl(x)
 ((null x) x)
 (append (last x) (cut x))
)
 
(defun cut(x)
 ((null x) x)
 ((null (cdr x)) nil)
 (cons (car x) (cut (cdr x)))
)
 
(defun ncycl (n x)
 ((= n 0) x)
 ((> n 0) (ncycl (- n 1) (cycl x)))
)
 
(ncycl 3 '(a b c d e f g h))

(defun shift-right (w n) 
  (append (last w n) (butlast w n)))
 
> (shift-right '(a b c d e) 2)
(D E A B C)

(defun <r (w n &aux (m (if (minusp n) 0 n)))
  (append (last w m) (butlast w m)))
 
> (shift-right '(a b c d e) -1)
(A B C D E)
> (shift-right '(a b c d e) 0)
(A B C D E)
> (shift-right '(a b c d e) 1)
(E A B C D)
> (shift-right '(a b c d e) 2)
(D E A B C)

(defun shift-right (w n &aux (m (if (minusp n) 0 n)))
  (append (last w m) (butlast w m)))
 
> (shift-right '(a b c d e) -1)
(A B C D E)

(defun shift-right (w n)
  (let ((m (if (minusp n) 0 n)))
    (append (last w m) (butlast w m))))
 
> (shift-right '(a b c d e) -1)
(A B C D E)

(defun shift-right (w n)
  ((lambda (w m) 
     (append (last w m) (butlast w m)))
   w (if (minusp n) 0 n)))
 
> (shift-right '(a b c d e) -1)
(A B C D E)

(defun task (lst n &optional (l (length lst)))
   (append (subseq lst (- l n)) (subseq lst 0 (- l n))))
 
==> TASK
 
(task '(q w e r t y u i o p) 3)
 
==> (I O P Q W E R T Y U)
 
(task '(q w e r t y u i o p) 6)
 
==> (T Y U I O P Q W E R)