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: 2, 6, ['S', 'y', '2729', '9935', 'T', 'H', '3063', '9587']

Output: 12664


Input: Consider Input: 1, 1, ['x', 'g', 'X', 'j', 'k', '9821', 'n', 'd', '1709', 'r']

Output: 0


Input: Consider Input: 2, 9, ['5075', '8895', 'z', '2211', 'P', '693', '6501', '6831', '2439', 'P', '7969', '227']


Output: 27570