#include<bits/stdc++.h>
using namespace std;
const int N=1010;
queue<int>q;
int main()
{
int n,k;cin>>n>>k;
for(int i=1;i<=n;i++)q.push(i);
int j=1;
while(q.size()>1)
{
int t=q.front();
q.pop();
if(j%k&&j%10!=k)
{
q.push(t);
}
j++;
}
cout<<q.front()<<endl;
return 0;
}