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.
1, 15, ['J', '3209', 'Y', '9515', 'a', 'C', 'Z', '4225', '6467', 'R', '8569', '2981', 'C', 'X', 'H', 'Z', '3763', 'I', '4209', 's', '765', '3925', '8479']