#include <bits/stdc++.h>
#define endl '\n'
#define F first
#define S second
using namespace std;
#define ll long long
#define pb push_back
#define mod 1000000007
// #define int long long
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define CheckBit(x,k)   (x & (1LL << k))
#define SetBit(x,k)     (x |= (1LL << k))
#define ClearBit(x,k)   (x &= ~(1LL << k))
#define LSB(mask)       __builtin_ctzll(mask)
#define MSB(mask)       63-__builtin_clzll(mask) 
#define print(x)    cout << #x << " : " << x << endl
#define error1(x)   cerr << #x << " = " << (x) <<endl
#define coutall(v)  for(auto &it: v) cout<<it<<' '; cout<<endl
#define Abid_52     ios::sync_with_stdio(false);cin.tie(0),cin.tie(0)
#define error2(a,b) cerr<<"( "<<#a<<" , "<<#b<<" ) = ( "<<(a)<<" , "<<(b)<<" )\n"
#define UNIQUE(x)   sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
template <typename T, typename U> T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}
template <typename T, typename U> T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}

const int N = 2e5 + 10;
int dp[500][101][500];
int highestDivisor(int x) {
    for (int i = x / 2; i >= 1; --i) {
        if (x % i == 0) {
            return i;
        }
    }
    return 1;
}

int rec(int n, int m, int k) {
    if (k == 0) {
        return n;
    }
    if(dp[n][m][k] != -1)return dp[n][m][k];
    int bestValue = INT_MIN;
    for (int i = 1; i <= m; i++) {
        int newN1 = n + i;
        int newN2 = (n - i >= 2) ? n - i : INT_MIN;

        if (newN1 != INT_MIN) {
            int divisor1 = highestDivisor(newN1);
            bestValue = max(bestValue, rec(newN1/divisor1, m, k - 1));
        }
        if (newN2 != INT_MIN) {
            int divisor2 = highestDivisor(newN2);
            bestValue = max(bestValue, rec(newN2/divisor2, m, k - 1));
        }
    }
    return dp[n][m][k] = bestValue;
}

void solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    memset(dp, -1, sizeof dp);
    cout << rec(n, m, k) << endl;
}

int32_t main()
{
    Abid_52;
    int t = 1;
    cin >> t;
    for (int tc = 1; tc <= t; ++tc)
    {
        // cout << "Case " << tc << ": ";
        solve();
    }
}