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, 21, ['S', 'y', '7447', '9693', 'd', '5217', 'G', 'n', '1155', '5455', '9661', '2969', '6597', '9121', 'x', '4071', '1315', '3459', 'G', 'K', '3619', '9197', 'N', '7707', 'Z', '8539', '423', '9323', '6123', 'J']