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: Consider Input: 4, 9, ['k', 'N', 'd', '9345', '2971', 'Q', '917', 'X', '417', 'y', 'B', '6149', '9769', '9949', '2339', 'Q', 'A', 'r', '1059', 'c', 'U', 'p', '6951', 'Z', 'F', '7753', 'g']

Output: 13650


Input: Consider Input: 4, 14, ['99', 'F', '1297', '7085', 'u', 'w', 'w', '3803', 'F', 'D', 'F', 'L', '5967', '3545', 'E']

Output: 20400


Input: Consider Input: 3, 4, ['h', 'X', 'A', '7855', 'V']


Output: 7855