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

17, 22, ['D', '7897', '1603', 'L', '5485', 'S', 'V', '1361', 'a', '9131', 'm', 'V', 'l', 'v', 'Z', '4831', '9561', '1185', 'y', 'D', '1853', '2225', 'j', 'r']
14824

20, 24, ['9719', '3207', '1647', '1975', 'M', '3061', 'Y', '9585', 'P', 'z', 'N', '7045', '2283', 'd', '9457', '7541', 'e', '5591', 'I', 'P', 'J', '3869', 'C', 'r', 'i', 'v', 'M', 'w']

3869