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.

[EX Q]: 1, 6, ['7349', 'S', '4839', 'R', '4443', '7569', '7307']
[EX A]: 24200

[EX Q]: 4, 9, ['9557', '1661', 'E', '5173', 'o', '4963', '2811', '5471', '3853']
[EX A]: 22271

[EX Q]: 2, 2, ['9249', '7435']
[EX A]:
7435