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.

7, 17, ['n', '1023', '2743', 'r', '5855', 'd', '4425', '3381', 'x', '9609', 'f', 'o', '8513', 'e', '7331', 'N', '7949', 'O']
41208

2, 9, ['7111', '835', 'W', '6975', '4459', 'B', 'B', 'Z', 'o']
12269

9, 10, ['x', 'W', '7449', 'u', '4379', 'q', 'o', '8655', '3661', '7259', 'u', 't', '2937']

10920