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: 21, 24, ['6903', '3349', '4585', 'C', 'w', 'I', 'U', 'n', '2689', 'W', '6601', '7357', '5063', 'y', '5779', 'L', '4257', 'd', '653', 'k', '8349', 'r', 'Y', '3019', 'E', '797', 'm']
Example Output: 11368

Example Input: 1, 6, ['S', 'i', 'F', 'w', '6345', 'L', '9727', 'u', 'F', '7911', 'K', '3151', '6181', 'N', 'a']
Example Output: 6345

Example Input: 2, 3, ['r', '6091', '9659', 'V', '4125', '6743', '611', 'o', '8735', '2485', 'q']
Example Output:
15750