// Time Complexity : O(n)
import java.util.*;
import java.io.*;
class GFG
{
static int check(int n, int k)
{
if(n == 1)
return 0;
else
return (check(n - 1, k) + k) % n;
}
static int josephus(int n, int k)
{
return check(n, k) + 1;
}
public static void main(String args[])
{
System.out.println(josephus(5, 3));
}
}