Div Times Mod

https://codeforces.com/contest/1087/problem/B

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=10000;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const ll INF = 0x3f3f3f3f3f3f;
int t,n,m,k,q;

int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    scanf("%d%d",&n,&k);
    //while(n++)
    ll ans=INF;
    for(int i=1;i<=n;i++){
        if(n%i==0&&n/i<k){
            ans=min(ans,(long long)i*k+n/i);
        }
    }
    cout<<ans<<endl;
    //cout << "Hello world!" << endl;
    return 0;
}