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: 9, 12, ['6001', '6723', '1813', 'S', '3331', 'T', '297', '8105', '7529', 'f', '1459', '323', '8077', 'N', 'W', 'G', 's', 'z', '7559', 't', 'F', 'h', '3771', '975']
Example Output: 9311

Example Input: 1, 1, ['7479', 'q', 'F', '5725', '7697', '6653', '275', 'l', '7349', 'c']
Example Output: 7479

Example Input: 1, 3, ['L', 'R', 'U', '2113', 'n', '661', 'n', '6235', 'l', '9631', '2079', 'm', 'i', 'W', '5995', 'n', 'R', 'G']
Example Output:
0