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.

9, 21, ['Z', 'Z', '853', '8745', 'L', '4401', 'a', 'L', '8237', 'h', '9163', '1891', '5049', '7075', '1437', '7377', 'E', 't', '837', 'B', 'z', '5629', 'm', 'z', '365', 'M', '8877', '27']
41066

17, 18, ['449', '4995', 'M', '245', 'i', '6859', 'A', '3527', '7063', 'l', '2869', 'Z', '8739', '7057', '4815', '3263', 'P', 'l', '393', 'P', '1701', '5135', 'G', 'O', 'y', 'o', '3815']
0

3, 12, ['D', '9845', 'n', 'K', 'e', 'A', 'k', 't', '4019', '5435', '837', 'p', '2147']

10291