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:
3, 4, ['6203', 'g', '471', 'j', 'o', '9679', 'M', '5459', 'y', '1929', '1649', 'C']

Ex Output:
471


Ex Input:
1, 11, ['R', 'k', '4813', '655', '3185', 'M', '4199', '1857', '9829', '6389', 'X', '3405', 'P', 'x']

Ex Output:
30927


Ex Input:
2, 5, ['5441', '9593', '5287', 'T', '8111', 'R', '6449', '6413', 'C', 'Z', '9773']

Ex Output:

22991