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.
8, 10, ['3753', '8047', 'Y', 'd', 'O', '621', '6987', '3567', 'r', '9557', 'j', 'a', 'l', 'R', 'u', 'N', 'r', '2499', '9767', 'g', 'B', '7147', '1953', 'J', 'Z', 'c']