def eulerian_num(n, m):
    if n < 0 or m < 0 or m >= n:
        return 0
    if n == 0:
        return 1 if m == 0 else 0

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

    for current_n in range(2, n + 1):
        new_dp = [0] * n
        for current_m in range(current_n - 1):
            left = (current_n - current_m) * dp[current_m - 1] if current_m > 0 else 0
            right = (current_m + 1) * dp[current_m]
            new_dp[current_m] = left + right
        dp = new_dp

    return dp[m]