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: 6, 15, ['U', 'G', '4461', '7163', '5651', 'x', '4017', 'W', '7237', 'k', 'b', 'k', 'h', '9147', 'T', '9035', '537', 'Y', 'Q']

Output: 20401


Input: Consider Input: 2, 3, ['9191', 'D', '1937', 'N', 'g', '3485', '7327']

Output: 1937


Input: Consider Input: 1, 5, ['c', 'd', 'L', '3613', '6059', 't']


Output: 9672