Definition: 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.
Input: 1, 23, ['i', '4557', 'd', 'o', '27', '5029', '5375', '9431', '9789', 'X', '8415', 'u', 'x', 'V', 'R', 'X', 'U', '4849', '3079', '4705', 'h', 'C', 'c', '9149', 'd', 'T', '3379', '6893', 'r']

55256