title: Distributing M Items Circle Size N Starting K Th Position
signature: int distributingMItemsCircleSizeNStartingKThPosition(int n, int m, int k) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int n, int m, int k, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n, m, k), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(19, 14, 34, 9); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(23, 51, 5, 9); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(92, 10, 24, 33); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(9, 50, 34, 2); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(20, 67, 20, 6); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(68, 25, 40, 64); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(66, 30, 24, 53); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(77, 22, 32, 53); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(90, 1, 71, 71); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(26, 34, 54, 9); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def distributing_m_items_circle_size_n_starting_k_th_position(n, m, k):
      if (m <= ((n - k) + 1)):
          return ((m + k) - 1)
      m = (m - ((n - k) + 1))
      if ((m % n) == 0):
          return n
      else:
          return (m % n)
source_cpp: int distributing_m_items_circle_size_n_starting_k_th_position(int n, int m, int k) {
    if ( m <= n - k + 1 ) return m + k - 1;
    m = m - ( n - k + 1 );
    return ( m % n == 0 ) ? n : ( m % n );
  }