Pussit

from math import ceil
# n=pussit, m=pallot, k=varmasti n:monta
tests=[]
for _ in range(int(raw_input())):
    tests.append([int(q) for q in raw_input().split()])
for t in tests:
    n,m,k=t
    p=[0 for _ in range(n)]
    m_=m
    for i in range(len(p)):
        p[i]=[int(min(m_,ceil(float(m)/len(p)))),True]
        m_-=min(m_,ceil(float(m)/len(p)))
    r=0
    s=0
    while s<k:
        o = sorted([[i[0],i[1][0]] for i in enumerate(p) if i[1][1]],key=lambda q:q[1])
        if o[0][1]==0:
            p[o[0][0]][1]=False
            r+=1
        else:
            s+=1
            p[o[0][0]][0]-=1
            r+=1
    print r

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: RUNTIME ERROR