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:
6, 10, ['2095', '7189', 'j', 'i', '6105', 'f', 'I', 'z', '7903', '7165']

Ex Output:
15068


Ex Input:
3, 4, ['2977', 'i', 'l', 'r', '8835', '7697', 'p', '1685', 'h', 'N', 'Z', '8661', '6003', '7007', 'D', 'C']

Ex Output:
0


Ex Input:
15, 22, ['5511', 'o', 'j', 'T', '2859', 'c', 'a', '6797', 'n', 'S', 'W', '3259', '1733', '4183', '4535', 'R', 'w', 'O', '1355', 'j', 'j', 'e']

Ex Output:

5890