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: 1, 14, ['9503', '5983', '143', 'j', '9227', 'g', 'X', '5995', '6623', 'k', 'q', '1047', '2815', '569', 's', 'D', '4045', 'G', '9707', '6707', '7953', 'R']

Output: 41905


Input: Consider Input: 8, 8, ['9433', '6635', 't', '4425', 'R', '5893', 'z', 'P', 'V', 'f']

Output: 0


Input: Consider Input: 8, 9, ['4823', '1779', 'o', '2273', '7931', '551', 'Q', '6787', '5779', 'p', 'E']


Output: 12566