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.
5, 6, ['w', '6925', 'l', 'Q', 'k', 'Z', 'e', '7721', '1605', 'd', '6933', '751', '3175', 'J', '2939', 'p', 'v', 'P', '5263', 'i', '8837', '9295', '4395', '6059', '2739', '3273', 'm', '3569', '931']