#include <vector>
#include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <utility>

struct blk {
  bool pt[ 5 ][ 5 ][ 5 ];
  int x1, x2, y1, y2, z1, z2;
  blk (int x1, int x2, int y1, int y2, int z1, int z2) {
    this->x1 = x1;  
    this->x2 = x2;  
    this->y1 = y1;  
    this->y2 = y2;  
    this->z1 = z1;  
    this->z2 = z2;  
    int i,j,k;
    for (i= 0 ;i< 5 ;++i)
      for (j= 0 ;j< 5 ;++j)
        for (k= 0 ;k< 5 ;++k)
          pt[i][j][k] = (i>=x1 && i<=x2 && j>=y1 && j<=y2 && k>=z1 && k<=z2);
  }

  blk (const blk &rt) {
    this->x1 = rt.x1;  
    this->x2 = rt.x2;  
    this->y1 = rt.y1;  
    this->y2 = rt.y2;  
    this->z1 = rt.z1;  
    this->z2 = rt.z2;  
    int i,j,k;
    for (i= 0 ;i< 5 ;++i)
      for (j= 0 ;j< 5 ;++j)
        for (k= 0 ;k< 5 ;++k)
          pt[i][j][k] = rt.pt[i][j][k];
  }

  blk (void) {
    int i,j,k;
    for (i= 0 ;i< 5 ;++i)
      for (j= 0 ;j< 5 ;++j)
        for (k= 0 ;k< 5 ;++k)
          pt[i][j][k] = false;
  }

  bool intersect (const blk &rt) {
    int i,j,k;
    for (i= 0 ;i< 5 ;++i)
      for (j= 0 ;j< 5 ;++j)
        for (k= 0 ;k< 5 ;++k)
          if (pt[i][j][k] && rt.pt[i][j][k]) return true;
    return false;
  }

  void unite (const blk &rt) {
    int i,j,k;
    for (i= 0 ;i< 5 ;++i)
      for (j= 0 ;j< 5 ;++j)
        for (k= 0 ;k< 5 ;++k)
          pt[i][j][k] = pt[i][j][k] || rt.pt[i][j][k];

  }

  void diff (const blk &rt) {
    int i,j,k;
    for (i= 0 ;i< 5 ;++i)
      for (j= 0 ;j< 5 ;++j)
        for (k= 0 ;k< 5 ;++k)
          pt[i][j][k] = pt[i][j][k] && !rt.pt[i][j][k];
  
  }
};

void gen(std::vector<blk> &v, int a, int b, int c) {
  int i,j,k;
  for (i= 0 ;i+a<= 5 ;++i)
    for (j= 0 ;j+b<= 5 ;++j)
      for (k= 0 ;k+c<= 5 ;++k)
        v.push_back(blk(i,i+a- 1 ,j,j+b- 1 ,k,k+c- 1 ));
}

bool find_next(blk &t,const std::vector<blk> &v,int p[ 6 ]) {
 int a,b,c,d,e,f;
 for(a=p[ 0 ];a<v.size()- 5 ;p[ 1 ]=++a+ 1 ,p[ 2 ]=p[ 1 ]+ 1 ,p[ 3 ]=p[ 2 ]+ 1 ,p[ 4 ]=p[ 3 ]+ 1 ,p[ 5 ]=p[ 4 ]+ 1 ) {
  t = v[a];
  for(b=p[ 1 ];b<v.size()- 4 ;p[ 2 ]=++b+ 1 ,p[ 3 ]=p[ 2 ]+ 1 ,p[ 4 ]=p[ 3 ]+ 1 ,p[ 5 ]=p[ 4 ]+ 1 ) {
   if (t.intersect(v)) continue;
   t.unite(v[b]);
   for(c=p[ [b]2 ];c<v.size()- 3 ;p[ 3 ]=++c+ 1 ,p[ 4 ]=p[ 3 ]+ 1 ,p[ 5 ]=p[ 4 ]+ 1 ) {
    if (t.intersect(v[c])) continue;
    t.unite(v[c]);
    for(d=p[ 3 ];d<v.size()- 2 ;p[ 4 ]=++d+ 1 ,p[ 5 ]=p[ 4 ]+ 1 ) {
     if (t.intersect(v[d])) continue;
     t.unite(v[d]);
     for(e=p[ 4 ];e<v.size()- 1 ;p[ 5 ]=++e+ 1 ) {
      if (t.intersect(v[e])) continue;
      t.unite(v[e]);
      for(f=p[ 5 ];f<v.size();++f) {
       if (t.intersect(v[f])) continue;
        t.unite(v[f]);
        p[ 0 ]=a;p[ 1 ]=b;p[ 2 ]=c;p[ 3 ]=d;p[ 4 ]=e;p[ 5 ]=f;
        return true;
      }
      t.diff(v[e]);
     }
     t.diff(v[d]);
    }
    t.diff(v[c]);
   }
   t.diff(v);
  }
 }
 return false;
}

bool try_push(blk &t,const std::vector<blk> &w,int p[ [b]6 ]) {
 int a,b,c,d,e,f;
 std::vector<std::pair<int,blk> > v;
 for (int i= 0 ;i<w.size();++i)
  if (!t.intersect(w[i])) v.push_back(std::make_pair(i,w[i]));
 if (v.size()< 6 ) return false;
 for(a= 0 ;a<v.size()- 5 ;++a) {
  if (t.intersect(v[a].second)) continue;
  t.unite(v[a].second);
  for(b=a+ 1 ;b<v.size()- 4 ;++b) {
   if (t.intersect(v.second)) continue;
   t.unite(v[b].second);
   for(c=b+ [b]1 ;c<v.size()- 3 ;++c) {
    if (t.intersect(v[c].second)) continue;
    t.unite(v[c].second);
    for(d=c+ 1 ;d<v.size()- 2 ;++d) {
     if (t.intersect(v[d].second)) continue;
     t.unite(v[d].second);
     for(e=d+ 1 ;e<v.size()- 1 ;++e) {
      if (t.intersect(v[e].second)) continue;
      t.unite(v[e].second);
      for(f=e+ 1 ;f<v.size();++f) {
       if (t.intersect(v[f].second)) continue;
//        t.unite(v[f].second);
        p[ 0 ]=v[a].first;p[ 1 ]=v.first;p[ [b]2 ]=v[c].first;p[ 3 ]=v[d].first;p[ 4 ]=v[e].first;p[ 5 ]=v[f].first;
        return true;
      }
      t.diff(v[e].second);
     }
     t.diff(v[d].second);
    }
    t.diff(v[c].second);
   }
   t.diff(v.second);
  }
  t.diff(v[a].second);
 }
 return false;
}


int main() {
  int p[ [b]6 ]={ 0 , 1 , 2 , 3 , 4 , 5 },q[ 6 ];

  std::vector<blk> v;
  gen(v, 2 , 2 , 3 );
  gen(v, 2 , 3 , 2 );
  gen(v, 3 , 2 , 2 );
  std::cout << v.size() << '\n';

  std::vector<blk> w;
  gen(w, 1 , 2 , 4 );
  gen(w, 1 , 4 , 2 );
  gen(w, 2 , 1 , 4 );
  gen(w, 2 , 4 , 1 );
  gen(w, 4 , 1 , 2 );
  gen(w, 4 , 2 , 1 );
  std::cout << w.size() << '\n';

//  std::random_shuffle(w.begin(),w.end());
//  std::random_shuffle(v.begin(),v.end());

  blk t;

  while(find_next(t,v,p)){
    if (try_push(t,w,q)) {
      int i;
      std::cout << "Success\n";
      for(i= 0 ;i< 6 ;++i)
        std::cout << v[p[i]].x1+ 1  << '-' << v[p[i]].x2+ 1  << ',' << v[p[i]].y1+ 1  << '-' << v[p[i]].y2+ 1  << ',' << v[p[i]].z1+ 1  << '-' << v[p[i]].z2+ 1  << '\n';
      std::cout << '\n';
      for(i= 0 ;i< 6 ;++i)
        std::cout << w[q[i]].x1+ 1  << '-' << w[q[i]].x2+ 1  << ',' << w[q[i]].y1+ 1  << '-' << w[q[i]].y2+ 1  << ',' << w[q[i]].z1+ 1  << '-' << w[q[i]].z2+ 1  << '\n';
      std::cout << '\n';
    }
    ++p[ 5 ];
  }
  std::cout << "Finished\n";
}