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.

Ex Input:
1, 2, ['7321', '6233']

Ex Output:
13554


Ex Input:
2, 5, ['9153', 'S', '605', '2951', 'I', 'o', '4995', '2895']

Ex Output:
3556


Ex Input:
2, 9, ['J', '87', 't', 'Z', '7841', 'j', '1109', '8305', 'u', '115', 'Q', 'o', '2499', '2117', '9115', '2525', 'f', '4505']

Ex Output:

17342