ANARC08H.cpp

#include <bits/stdc++.h>
#include <cstdio>
#define ll int
#define get(a) scanf("%d", &a)
#define rep(n) for( ll i = 0; i < n; i++ )
#define repVector(v)  for(vector<ll>::iterator it = v.begin(); it != v.end(); it++ )
#define repSet(s) for( set<ll>::iterator it = s.begin(); it != s.end(); it++ )
#define all(c) c.begin(), c.end()
#define repu(a,n) for( ll i = a; i <= n; i++ )
#define pb push_back
#define min(a,b) ( (a < b) ? a : b )
#define max(a,b) ( (a > b) ? a : b )
#define absol(a) a >= 0 ? a : -a
#define FOR(i,a,b) for( ll i = a; i < b; i++ )
#define matrix vector< vector<ll> >
#define MOD 1000000007
#define L 2*r
#define R 2*r+1
using namespace std;

ll gcd( ll a, ll b ) {  return ( b == 0 ? a : gcd( b, a%b ) ); }

int main() {
   while(1) {
   	  ll n, d;
   	  get(n); get(d);
   	  if( n == 0 && d == 0 )
   	  	return 0;
   	  	
   	  ll ans = 0;
   	  
   	  FOR(i,1,n+1)
   	   ans = (ans + d)%i;
   	   
   	  printf("%d %d %d\n", n, d, ans+1 );
   }
   
}