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