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:
5, 12, ['4439', 'P', 'e', '4929', '2085', 'w', 'C', '5385', '6517', 'w', '6257', '9721']

Ex Output:
29965


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

Ex Output:
19497


Ex Input:
1, 6, ['3349', 'h', '6473', '5791', '1385', '8005', 'X', '5651', 'G', '9013', 'W', '7903', '5889']

Ex Output:

25003