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: 2, 9, ['5655', '7555', 'T', '3387', 'G', '9547', 'Z', '8679', '1561', 'E', '469']

Output: 30729


Input: Consider Input: 5, 12, ['4439', 'P', 'e', '4929', '2085', 'w', 'C', '5385', '6517', 'w', '6257', '9721']

Output: 29965


Input: Consider Input: 2, 7, ['1461', '9089', '1967', 'x', 'b', 'E', '4439', '6971', '1147', 'P', '4205']


Output: 15495