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: 4, 14, ['99', 'F', '1297', '7085', 'u', 'w', 'w', '3803', 'F', 'D', 'F', 'L', '5967', '3545', 'E']
Example Output: 20400

Example Input: 1, 2, ['7321', '6233']
Example Output: 13554

Example Input: 2, 4, ['t', '9653', '5385', 'E', 'Z', 'T', '7965', 'W', 'A', 'M']
Example Output:
15038