from itertools import product

alphabet = '0123456'

ap=[]

for i in product(alphabet, repeat=4):

if i[0] > i[1] > i[2] > i[3]:

ap.append(i)

print(len(ap))

k = 0

for i1 in range(7):

for i2 in range(7):

for i3 in range(7):

for i4 in range(7):

if i1 > i2 and i2 > i3 and i3 > i4:

k += 1

print(k)

def f7(x):

s = ''

while x:

s = str(x%7) + s

x = x//7

return s

k = 0

for i in range(int('6666',7)+1):

s = f7(i)

if len(s) == 4 and s[0] > s[1] > s[2] > s[3] :

k+=1

print(k)

from itertools import product

alphabet = '012345678'

ap=[]

for i in product(alphabet, repeat=5):

if i[0] != '0' and int(i[0]) > int(i[1]) > int(i[2]) > int(i[3]) > int(i[4]):

ap.append(i)

print(len(ap))

al = '012345678'

count = 0

for b1 in '12345678':

for b2 in al:

for b3 in al:

for b4 in al:

for b5 in al:

s = b1+b2+b3+b4+b5

n = 0

for i in range(4):

if s[i] > s[i+1]:

n += 1

if n == 4:

count += 1

print(count)

from itertools import *

cnt = 0

for a in permutations('012345678' , 5):

if all(a[j] > a[j+1] for j in range(4)):

cnt += 1

print(cnt)

k = 0

for i1 in range(9):

for i2 in range(9):

for i3 in range(9):

for i4 in range(9):

for i5 in range(9):

if i1 > i2 and i2 > i3 and i3 > i4 and i4 > i5:

k += 1

print(k)

def f9(x):

s = ''

while x:

s = str(x%9) + s

x = x//9

return s

k = 0

for i in range(int('88888',9)+1):

s = f9(i)

if len(s) == 5 and s[0] > s[1] > s[2] > s[3] > s[4] :

k+=1

print(k)