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, 8, ['9433', '6635', 't', '4425', 'R', '5893', 'z', 'P', 'V', 'f']

Ex Output:
0


Ex Input:
1, 13, ['9225', '8983', 'E', 'F', 'L', 'V', 'h', '9233', '8887', 'o', 'd', 'U', 'B', 'u']

Ex Output:
36328


Ex Input:
21, 25, ['R', '3129', 'S', '747', '3307', '6769', 'i', 'e', 'G', '999', '927', '8459', '4785', '4255', 'E', 'g', '5897', '5107', 'Y', 'S', '6987', '3235', 'k', 'P', 'y']

Ex Output:

10222