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, ['v', 't', '4357', '1303']

Ex Output:
5660


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

Ex Output:
30927


Ex Input:
4, 12, ['8185', '8575', '7191', 'R', '535', '6925', 'T', '9117', 'D', '57', '6123', 'l', '5833', 'h', 'H', 'C', '6037']

Ex Output:

22757