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.
11, 12, ['6961', '5179', 'v', 'q', '9303', 'H', 'm', 'h', 'X', '4345', '5883', '6175', '8091', '7731', '5289', '4207', 'f', 'z', '5107', '3865', 'W', 'R', '3051', '3317', '4469']