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, 9, ['V', 'x', '3763', '8367', '3369', '6695', 'p', 'P', 'L', 'g', 's', '5117', 'n', '5097', '2407', '6337', '5437', 'o', '3023', 'D', 'g']
Example Output: 0

Example Input: 2, 6, ['2495', '83', '1257', '9157', 'z', 'Y', '8689', '385', '747', '1175', 'j', 'U', 'k']
Example Output: 10497

Example Input: 3, 3, ['e', 'R', 'k', '7955', 'g', 'j', 'S', '2549']
Example Output:
0