omega2 level python function (recursive)

First program

"Listen, sheep, our hearts pain us when we see this: a man, the master, makes the wool of the sheep into a warm garment for himself. And the sheep has no wool."

  —Schleicher fable

def f(a, b, n):
    if n == 1:
        return a + b
    if b == 1:
        return b
    else:
        result = f(a, f(a, b-1, n), n-1)
        return result


def g(a,b,n):
    if n==1:
        return f(a,a,a)
    if b==1:
        return b
    else:
        g(a, g(a, b-1, n), n-1)
        
print(g(2023,2023,2023))

Second program

def f(a, b, n, m):
    if a == 1:
        return a
    if n == 1 and m != 1:
        return a+b
    if n ==1 and m == 1:
        return a+b
    if n ==1 and m > 1:
        f(a,a,f(a,b-1,n,m),m-1)
    else:
        f(a,f(a,b-1,n,m),n-1,m)
        
print(f(2023,2023,2023,2023))