Definition: 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.
Input: 1, 17, ['5349', 'o', '9705', 'X', 'P', 'r', 'W', '8679', 'i', 'c', 'E', '9231', '9445', 'f', 'E', '2591', 'W']

45000