Codeforces 1359A - Berland Poker Solution

 ///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

///La ilaha illellahu muhammadur rasulullah

#include <bits/stdc++.h>

using namespace std;

int main()

{

    int t,v,n,m,k,a;

    cin>>t;

    while(t--)

    {

        cin>>n>>m>>k;

        a=n/k;

        if(a>=m)

            cout<<m<<endl;

        else

        {

            v=(m-a)/(k-1);

            if((m-a)%(k-1)!=0)

                cout<<a-(v+1)<<endl;

            else

                cout<<a-v<<endl;

        }

    }

}