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.
2, 6, ['v', '1765', 'F', 'F', 'e', '5635', '6649', '3987', 'f', '3757', '3697', 'T', 'B', 'Y', '6793', '3791', 'O', '229', '8351', '5695', 'T', 'i', '9501', 't', '5209']