stage_remark52: graphs=3000 edges=60327 on shortest paths of exactly two pairs=5386 of all three pairs=0; time=0.2s
