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.
7, 21, ['x', '7929', '7075', '8521', 'A', 'g', 'x', 'c', '6353', 'Q', 'p', 'W', 'm', '9935', 'O', '9427', '6489', 'l', '1993', '5943', 'Z', '6423', '7311', '3919', 'v', 'J']