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.
18, 18, ['J', 'i', '3141', 'O', 'O', 'w', 'D', '4487', 'W', '6585', 'I', '9611', 'N', 'J', '1861', '7585', 'Z', 'h', 'g', '6161', 'M', 'x', 'R', 'l', 'p', 'w', 'A', 'c']