sclass ReverseChain<A> {
  A element;
  ReverseChain<A> prev;
  int size;
  
  *() {}
  *(ReverseChain<A> *prev, A *element) {
    size = prev != null ? prev.size+1 : 1;
  }
  
  toString {
    ret str(toList());
  }
  
  L<A> toList() {
    L<A> l = emptyList(size);
    int i = size;
    ReverseChain<A> c = this;
    while (c != null) {
      l.set(--i, c.element);
      c = c.prev;
    }
    ret l;
  }
}