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, 9, ['S', 't', '243', '5691', '5695', 'Y', 'd', '8695', 'M', 'K', 'z', 'I', '7325', '8945', 'P', 'Q', 'I', 'N']

Ex Output:
20324


Ex Input:
7, 8, ['R', 'r', '6533', '3469', '3973', '1915', 'p', 't', 'a']

Ex Output:
0


Ex Input:
3, 7, ['8197', '7957', '3779', '9603', '6151', '3637', 'i', '1409', '8637', 'p']

Ex Output:

23170