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, ['F', '7341', 'P', '3315']

Ex Output:
3315


Ex Input:
8, 13, ['6413', 'n', 'z', 'T', 'R', 'Y', 'D', 'W', 'L', '521', '3411', 'B', 'O', '6757']

Ex Output:
3932


Ex Input:
12, 15, ['9573', '4563', '1283', '8957', 'w', 'E', 'k', '6319', 'o', '3613', 'D', '991', 'j', 'b', 'w', '8977', '6885', 'i']

Ex Output:

991