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, 2, ['M', 'I', 'G', '3747']

Output: 0


Input: Consider Input: 3, 4, ['L', 'D', 'T', 'b', 'i', 'X', '7319', '8655', '3183', '1833']

Output: 0


Input: Consider Input: 9, 15, ['9375', '9663', 'i', '9607', '4257', '9757', 'r', '937', 'm', 's', '9193', '2269', '4627', '2051', '7045']


Output: 25185