Normal algorithm, find the number of books borrowed by at least one person:

A+B+C-(A and B)-(B and C)-(A and C)+(A, B and C)

Now, A, B, C, A, B, C and C are all known.

The number of books borrowed by at least one person is:

33+44+55-29-36-25+ (A, B and C)

=42+ (A, b and c)

A&B 29

A-C 25

Ethylene propylene 36

Then A, B and C can borrow 25 books at most.

So at least one person has borrowed books, at most:

42+25=67 copies

So there are no books borrowed, at least:

100-67=33 copies