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.

Input: Consider Input: 3, 4, ['I', '8765', 'a', '719', '2555', 'w', '3437', '6159', 'e', '5239']

Output: 719


Input: Consider Input: 1, 10, ['9139', 'F', 'e', 'F', '8979', '831', '6811', '3677', '2937', '1001']

Output: 33375


Input: Consider Input: 10, 12, ['4579', 'j', '3551', 'F', 'm', '1521', '8115', 'p', '2841', '6281', 'f', 'u', '2959', '8255', 'q', '3009', '5343', 'P']


Output: 6281