In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
28, 29, ['9439', '4749', 'b', '5065', 'W', '3631', '4647', '2367', '7155', 'X', 'R', '7889', '3135', '5547', 'C', 'j', 'b', 'e', 'U', 'Y', '8799', 'z', 'h', '7759', '1913', '6103', 'y', 'M', 'B']