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.
21, 25, ['k', '4875', 'R', 'W', 'c', 'w', '3887', 'q', '6059', 'H', '6705', '8191', 's', '3829', 's', 'd', '4743', 'j', '9693', 'f', '3247', '9879', '6661', 'v', '57', 'q', 'r', 'x']