// output of ./demo/comb/perm1-topsort-demo.cc:
// Description:
//% Young tableaux of given shape.
//% The underlying driver is class perm1_topsort which is
//% Knuth's "Algorithm V", section 7.2.1.2, p.343 in vol.4A/1 of TAOCP.

args: multiplicities of elements
shape R[] = [ 3 3 3 ]

1:

  1  2  3
  4  5  6
  7  8  9

2:

  1  2  3
  4  5  7
  6  8  9

3:

  1  2  3
  4  5  8
  6  7  9

4:

  1  2  3
  4  6  7
  5  8  9

5:

  1  2  3
  4  6  8
  5  7  9

6:

  1  2  4
  3  5  6
  7  8  9

7:

  1  2  4
  3  5  7
  6  8  9

8:

  1  2  4
  3  5  8
  6  7  9

9:

  1  2  4
  3  6  7
  5  8  9

10:

  1  2  4
  3  6  8
  5  7  9

11:

  1  2  5
  3  6  7
  4  8  9

12:

  1  2  5
  3  6  8
  4  7  9

13:

  1  2  5
  3  4  6
  7  8  9

14:

  1  2  5
  3  4  7
  6  8  9

15:

  1  2  5
  3  4  8
  6  7  9

16:

  1  2  6
  3  4  7
  5  8  9

17:

  1  2  6
  3  4  8
  5  7  9

18:

  1  2  7
  3  4  8
  5  6  9

19:

  1  2  6
  3  5  7
  4  8  9

20:

  1  2  6
  3  5  8
  4  7  9

21:

  1  2  7
  3  5  8
  4  6  9

22:

  1  3  4
  2  5  6
  7  8  9

23:

  1  3  4
  2  5  7
  6  8  9

24:

  1  3  4
  2  5  8
  6  7  9

25:

  1  3  4
  2  6  7
  5  8  9

26:

  1  3  4
  2  6  8
  5  7  9

27:

  1  3  5
  2  6  7
  4  8  9

28:

  1  3  5
  2  6  8
  4  7  9

29:

  1  4  5
  2  6  7
  3  8  9

30:

  1  4  5
  2  6  8
  3  7  9

31:

  1  3  5
  2  4  6
  7  8  9

32:

  1  3  5
  2  4  7
  6  8  9

33:

  1  3  5
  2  4  8
  6  7  9

34:

  1  3  6
  2  4  7
  5  8  9

35:

  1  3  6
  2  4  8
  5  7  9

36:

  1  3  7
  2  4  8
  5  6  9

37:

  1  3  6
  2  5  7
  4  8  9

38:

  1  3  6
  2  5  8
  4  7  9

39:

  1  3  7
  2  5  8
  4  6  9

40:

  1  4  6
  2  5  7
  3  8  9

41:

  1  4  6
  2  5  8
  3  7  9

42:

  1  4  7
  2  5  8
  3  6  9

 ct=42