#include <iostream>#include <string>#include <cstring>#include <sstream>#include <fstream>#include <vector>#include <algorithm>#include <map>#include <set>#include <queue>#include <utility>#include <numeric>#include <cmath>#include <cstdio>#define IP(n) for(i=0;i<n;i++)#define JP(n) for(j=0;j<n;j++)#define KP(n) for(k=0;k<n;k++)#define vi vector<int>#define vi2 vector<vector<int>>#define vs vector<string>#define pb push_back#define TC int t,check=1;cin>>t;while(check<=t)#define FORIT(i,m) for(__typeof((m).begin()) i=(m).begin();i!=(m).end();i++)#define ms(x,a) memset(x,a,sizeof(x))using namespace std;int t,b,n;int calc(){ int sq=sqrt(t),mx=0; for(int i=1;i<=sq;i++) { if(t%i==0) { if(i<=n) mx=max(i,mx); if((t/i)<=n) { mx=max((t/i),mx); return mx; } } if(mx==n) return mx; } return mx;}int main(){ while(scanf("%d %d %d",&t,&b,&n)==3) { printf("%dn",n); } return 0;}
