#include <iostream>

using namespace std;

int main(int argc,char** argv)
{
  int son[3];
  int candidates[20][3];
  int ncandidates=0;
  bool solution[20];

  // product rule

  for (son[0]=0;son[0]<100;son[0]++)
    for (son[1]=son[0];son[1]<100;son[1]++)
      for (son[2]=son[1];son[2]<100;son[2]++)
	{
	  if (son[0] * son[1] * son[2] != 36) continue;

	  for (int i=0;i<3;i++)
	    candidates[ncandidates][i] = son[i];

	  solution[ncandidates]=false;
	  ncandidates++;
	}


  for (int i=0;i<ncandidates;i++)
    for (int k=0;k<ncandidates;k++)
      if (i!=k)
	{
	  // sum rule

	  if (candidates[i][0]+candidates[i][1]+candidates[i][2] !=
	      candidates[k][0]+candidates[k][1]+candidates[k][2])
	    continue;

	  // eldest rule

	  if (candidates[i][1] == candidates[i][2])
	    continue;

	  cout << candidates[i][0] << " " << candidates[i][1] << " " << candidates[i][2] << endl;
	}

  return 0;
}