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.

7, 17, ['149', 'O', 'h', '7873', '9227', '5655', '8945', 'I', 'c', 'V', 'Z', 'I', 'L', '1153', 'L', 'Y', '2031', 'B', 'S', 'x', 'u', '2483', 'M', '2469', '4991']
12129

2, 8, ['3651', '6881', '3701', 'M', '8543', '5995', 'q', 'A', 'S', '745']
25120

6, 16, ['e', 'T', 'f', '8027', 'd', 's', '5663', '4215', 's', '2073', 'Z', '3395', '1683', 'f', '7811', 'F', '6373', '645', 'i', '9593', '8435', 'F', 'Y', '1419', '1397', 'N', 'N']

24840