For 1 digits, all being 8 gives 1 digits, and 9^1 has 1 digits.
For 2 digits, all being 8 gives 3 digits, and 9^2 has 2 digits.
For 3 digits, all being 8 gives 4 digits, and 9^3 has 3 digits.
For 4 digits, all being 8 gives 5 digits, and 9^4 has 4 digits.
For 5 digits, all being 8 gives 6 digits, and 9^5 has 5 digits.
For 6 digits, all being 8 gives 7 digits, and 9^6 has 6 digits.
For 7 digits, all being 8 gives 8 digits, and 9^7 has 7 digits.
For 8 digits, all being 8 gives 9 digits, and 9^8 has 8 digits.

>>> k=5;float(9**39 * k + 8**39 * (39-k) )
8.776523532338918e+37

For 1 digits, you would need 0 copies of 9, making the search space 1.
For 2 digits, you would need 0 copies of 9, making the search space 10.
For 3 digits, you would need 0 copies of 9, making the search space 55.
For 4 digits, you would need 0 copies of 9, making the search space 220.
For 5 digits, you would need 0 copies of 9, making the search space 715.
For 6 digits, you would need 0 copies of 9, making the search space 2002.
For 7 digits, you would need 0 copies of 9, making the search space 5005.

For 1 digits, you would need 0 copies of 9, making the search space 9.
For 2 digits, you would need 0 copies of 9, making the search space 45.
For 3 digits, you would need 0 copies of 9, making the search space 165.
For 4 digits, you would need 0 copies of 9, making the search space 495.
For 5 digits, you would need 0 copies of 9, making the search space 1287.
For 6 digits, you would need 0 copies of 9, making the search space 3003.
For 7 digits, you would need 0 copies of 9, making the search space 6435.

def highestbit(n):
	shift = 1
	while (n&-~n) > 0:
		n |= n>>shift
		shift <<= 1
	return -~n

def bit_reverse(n):
	mark = highestbit(n)
	lo = 1, hi = mark
	while lo<hi:
		if ((lo&n)>0) != ((hi&n)>0):
			n ^= lo|hi
		lo <<= 1
		hi >>= 1

     4 classes (maximum  64)             4 objects (maximum 639)
     0 global vars (maximum 233)       480 variable/array space (maximum 10000)
     0 verbs (maximum 200)               0 dictionary entries (maximum 2000)
     0 grammar lines (version 1)         0 grammar tokens (unlimited)
     0 actions (maximum 200)             0 attributes (maximum 48)
     2 common props (maximum 62)         8 individual props (unlimited)
   118 characters used in text         104 bytes compressed (rate 0.881)

[ Main;
  print "Hello, World!^";
];