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: 10, 27, ['Y', 'Q', 'o', '9581', '2725', 'd', '8857', '1477', '2451', '8595', 'I', 'I', '4883', '3781', 'E', '9539', 'k', '1245', '6741', '2051', 'l', '5245', 'e', '6949', '4361', 'U', 'I', 'J', '7867', '991']

Output: 53390


Input: Consider Input: 3, 4, ['2977', 'i', 'l', 'r', '8835', '7697', 'p', '1685', 'h', 'N', 'Z', '8661', '6003', '7007', 'D', 'C']

Output: 0


Input: Consider Input: 7, 7, ['5867', 'T', '4865', '3609', 'O', 'C', '4417']


Output: 4417