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.
8, 17, ['9379', '5701', '375', '2407', '8327', 'd', 'g', 'n', '6801', '4997', '6197', '7139', 'v', '5403', '1859', '5571', 'Z', 'i', '1717', 'l', '5731', '3385', '5227', '7757', '5145']