#include<stdio.h>
#include<stdlib.h>

int sort(const float *a, const float *b)
{return (*a-*b);}

int main()
{
  int cuts[3];
  int c1,c2,s1,s2,p1,p2,cut1,cut2,cut3,cut4, v11,v12,v21,v22;
  scanf("%d %d %d %d %d %d",&c1,&c2,&s1,&s2,&p1,&p2);
  
  while(c1!=0 || c2!=0 || s1!=0 || s2!=0 || p1!=0 || p2!=0)
  {
    v11=c1*s1;
    v12=c1*s2;
    v21=c2*s1;
    v22=c2*s2;
    if(((v11>p1) ||(v12>p2)) && ((v12>p1)||(v21>p2)) && ((v11>p2)||(v22>p1)) && ((v12>p2)||(v21>p1)))
    {  
      printf("The paper is too small.\n");
    }
    if(v11<=p1 && v22<=p2)
    {
      cut1=0;
      if((p1-v11)==0)
        cut1+=c1-1;
      else cut1+=c1;
      if((p2-v22)==0)
        cut1*=c2;
      else cut1*=c2;
    }
     if(v11<=p2 && v22<=p1)
    {
      cut2=0;
      if((p2-v11)==0)
        cut2+=c1-1;
      else cut2+=c1;
      if((p1-v22)==0)
        cut2*=c2;
      else cut2*=c2;
    }
     if(v12<=p1 && v21<=p2)
    {
      cut3=0;
      if((p1-v12)==0)
        cut3+=c1-1;
      else cut3+=c1;
      if((p2-v21)==0)
        cut3*=c2;
      else cut3*=c2;
    }
     if(v12<=p2 && v21<=p1)
    {
      cut4=0;
      if((p2-v12)==0)
        cut4+=c1-1;
      else cut4+=c1;
      if((p1-v21)==0)
        cut4*=c2;
      else cut4*=c2;
    }
    cuts[0]=cut1;
    cuts[1]=cut2;
    cuts[2]=cut3;
    cuts[3]=cut4;
    qsort(cuts,4,sizeof(*cuts),(int(*)(const void *, const void *))sort);
    if(cuts[0]>0) printf("The minimum number of cuts is %d.\n",cuts[0]);
    else if(cuts[1]>0) printf("The minimum number of cuts is %d.\n",cuts[1]);
    else if(cuts[2]>0) printf("The minimum number of cuts is %d.\n",cuts[2]);
    else if(cuts[3]>0) printf("The minimum number of cuts is %d.\n",cuts[3]); 
    scanf("%d %d %d %d %d %d",&c1,&c2,&s1,&s2,&p1,&p2);  
  }
  return 0;
}