//Yukicoder
//Q51 やる気
//




//二次元可変配列
//vector <vector <int>> mass;
//vector <vector <int>> memo;

//#include "stdafx.h"
#include <iostream>
#include <vector>
#include <list>//list
#include <set> //tree
#include <map> //連想配列
#include <unordered_set> //hash
#include <unordered_map> //hash
#include <algorithm>
#include <iomanip>

using namespace std;
typedef unsigned long long ULL;
typedef signed long long SLL;


#define START (0)
#define RIGHT (1)
#define UP    (2)
#define LEFT  (3)
#define DOWN  (4)

#define DATA_MAX (1000000)
#define FMAX(a,b)  ((a)>(b)?(a):(b))
#define FMIX(a,b)  ((a)<(b)?(a):(b))


vector <vector <SLL>> memo2;
vector<SLL> memo1;
vector<SLL> c;
vector<SLL> v;
vector<SLL> dp;

SLL N,  H ,A, B, T;






int main()
{
	SLL W, D, task;

	//float min = INFINITY;

	cin >> W;
	cin >> D;

	for (;;)
	{

		task = W / (D*D);
		
		if (D == 1)
			break;
		W -= task;
		D = D - 1;

	}
	
	cout << W;

	//getchar();
	return 0; //end
}