def eulerian_num(n, m):
    if not isinstance(n, int) or not isinstance(m, int):
        raise TypeError("n and m must be integers")
    if n < 0 or m < 0:
        return 0
    if n == 0:
        return 1 if m == 0 else 0
    if m >= n:
        return 0

    dp = [0] * n
    dp[0] = 1

    for i in range(1, n + 1):
        new = [0] * n
        upper = min(i - 1, m)
        for j in range(0, upper + 1):
            val = 0
            if j > 0:
                val += (i - j) * dp[j - 1]
            if j < i - 1:
                val += (j + 1) * dp[j]
            new[j] = val
        dp = new

    return dp[m]