There are \(101\) people sitting at a round table in any order with \(1,2,\dots , 101\) cards respectively in some order. A transfer consists of someone giving one card to one of the two people adjacent to them. Find the smallest positive integer \(k\) such that no matter the original configuration it's possible to perform at most \(k\) transfers to make each person have the same number of cards.