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, 5, ['r', 'Y', '3769', 'k', '6407', 'G', 'M']

Ex Output:
10176


Ex Input:
6, 9, ['7895', '3853', 's', '7', '1351', '5409', 'y', 'R', '329', 'l', 'v', '569', '8461', 'O', 'p', '2845']

Ex Output:
5738


Ex Input:
4, 12, ['k', '7775', '1099', '1507', '7609', 'X', 'O', '521', 'u', 'V', 't', '1935', '8171', '2063', 'h', '2961', 'z', '4955', '1359', 'm', '2137']

Ex Output:

11572