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.

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

Example Input: 1, 6, ['7349', 'S', '4839', 'R', '4443', '7569', '7307']
Example Output: 24200

Example Input: 2, 4, ['l', 'A', '1815', '65', 'O', '9729', '5249', 'J']
Example Output:
1880