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:
8, 9, ['P', 'V', '5567', 'm', 'V', '9533', '2381', '1095', '835', 'B', 'z', 'J', 'H', 't', 'b', 'z', 'e']

Ex Output:
1930


Ex Input:
3, 8, ['g', 'D', 'W', 'q', '7817', '9295', '2385', 'V', 'c', '7761']

Ex Output:
19497


Ex Input:
14, 26, ['X', '8493', '9995', '2255', '2667', 'k', '9811', 'w', '1705', '1389', 'Q', '3131', '421', 'I', 'r', 'D', 'r', 'E', 'Y', '4343', 'r', '6979', '3989', 'I', 's', '641', '443', '2689', '3199', '2849']

Ex Output:

15952