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:
13, 14, ['6693', 'J', '2765', 'P', 'h', '755', 'z', '7483', 'W', '6895', '1293', '3479', 'Y', '1667', '9635']

Ex Output:
1667


Ex Input:
2, 16, ['v', 'd', '6599', 'd', '9305', '6377', '5009', '3797', '3861', '9421', 'G', 'N', 'm', 'x', 'E', '7047', 'W', '5629', 'j']

Ex Output:
51416


Ex Input:
10, 14, ['2863', '6961', '7205', '7333', '4181', '7219', '7153', '6541', 'k', 'x', 'k', '9693', '2403', 'O', '9515', '6823', '7189', '995']

Ex Output:

12096