#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

const long long INF = 1e6+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);

using namespace std;

int main(){
	long long w,d;
	cin >> w >> d;
	vector<long long> v;
	while(d){
		long long temp=w/(d*d);
		v.push_back(temp);
		w-=temp;
		d--;
	}
	sort(v.begin(),v.end(),greater<long long>());
	cout << v[0] << endl;
	return 0;
}