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.

10, 12, ['465', 'V', '3045', 'M', 'Z', '4053', '9621', '6909', '3161', 'M', '6675', '2313', 'v', 'g', 'a', 'x', '9347', 'd', 'x', '4309', '7231', '9745', 'F', '8863', '4667', '2089', 'x']
8988

2, 10, ['9653', '3845', 'm', 'K', 'j', '5041', 'W', 's', 'j', 'A', 'G']
8886

5, 21, ['8563', 'v', 'y', '4363', '9837', '6357', '289', 'V', 's', 'G', 'F', '8287', 'V', 'x', '8173', '9787', 'o', '6827', 'v', '1165', '2179', 'C', '971', '7899', '1899', 'f', 'j', 'x', 'V', 'X']

52901