void insertLast(List &L, address P){
    Q = first(L);
    while ( next(Q) != first(L) ) {
        Q = next (Q);
    }
    next (Q) = P;
    prev (P) = Q;
    next (P) = first (L);
    prev (first(L)) = P;
}