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: 5, 6, ['F', 'u', '4899', 'P', '2029', 'A', '9641', '8201', 'e', 'g', 'Y', '3483', 'y', '6515', 'S']
Example Output: 2029

Example Input: 3, 7, ['k', 'm', 'W', '641', 'X', 'B', '897']
Example Output: 1538

Example Input: 6, 7, ['2943', 'Q', 'c', 'B', 't', 'k', 'u', '3135']
Example Output:
0