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: 3, 4, ['I', '8765', 'a', '719', '2555', 'w', '3437', '6159', 'e', '5239']
Example Output: 719

Example Input: 4, 12, ['k', '7775', '1099', '1507', '7609', 'X', 'O', '521', 'u', 'V', 't', '1935', '8171', '2063', 'h', '2961', 'z', '4955', '1359', 'm', '2137']
Example Output: 11572

Example Input: 12, 15, ['4557', 'A', 'X', '2345', '2451', '3237', 'o', 'C', '1181', '3245', 'L', 'C', '6399', 'V', 'P', '4125', '981', '6813', 'k']
Example Output:
6399