// Arup Guha
// 4/30/2007
// Solution to 2007 UCF HS Problem: Organize, written in practice contest

import java.util.*;
import java.io.*;

public class organize {

  public static void main(String[] args) throws IOException {

    Scanner fin = new Scanner(new File("organize.in"));

    // Read in box size.
    int l, w, h, cds;
    l = fin.nextInt();
    w = fin.nextInt();
    h = fin.nextInt();
    cds = fin.nextInt();

    // Go through cases.
    int cnt = 1;
    while (!(l==0 && w==0 && h==0 && cds==0)) {

       // Get the answer.
      int ans = big(l, w, h);

      // This is oru criteria.
      if (ans < 0 || 2*cds > ans)
        System.out.println("Box "+cnt+": Stack of "+cds+" discs does not fit.");
      else
        System.out.println("Box "+cnt+": Stack of "+cds+" discs fits!");

      // Go to next case.
      l = fin.nextInt();
      w = fin.nextInt();
      h = fin.nextInt();
      cds = fin.nextInt();
      cnt++;
    }
  }

  // Solves the case for the box a x b x c.
  public static int big(int a, int b, int c) {

  	// Two dimensions must be 120 or more.
    if (a < 120 && b < 120)
      return -1;
    if (a < 120 && c < 120)
     return -1;
    if (b < 120 && c < 120)
     return -1;

	// Limiting factor is minimum dimension here.
    if (a < 120) return a;
    if (b < 120) return b;
    if (c < 120) return c;

    // If all three are good, go with the max!
    return Math.max(c,Math.max(a,b));
  }

}