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:
2, 10, ['9653', '3845', 'm', 'K', 'j', '5041', 'W', 's', 'j', 'A', 'G']

Ex Output:
8886


Ex Input:
10, 11, ['L', 'Z', '4501', '4131', 'a', '8057', 'K', 'P', '4713', '8889', 'b', '3927', 'k', '6005', 'T', 'w', 'S', '3963', '2727']

Ex Output:
8889


Ex Input:
1, 13, ['b', '579', '4611', '9249', 'x', '6599', '615', 'A', '1979', '9869', 'a', '6829', 'n', 'O', '8325', '257', '6891', 'H', '6095', 'M', '2339', '4919', 'g', 'B', 'R', 'w', 'R', 'b']

Ex Output:

40330