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: 1, 14, ['T', 'y', 'L', 'l', '5307', 'j', '2235', '9617', 'e', '7687', 't', '4357', '1745', 'X', '8485', 'a', '1387', '1351', '6437', 'u']

Output: 30948


Input: Consider Input: 2, 12, ['Y', '5063', 'S', 'u', 'k', 'i', '7319', '6513', '9547', '6537', 'h', '6079', '8767', '2057', '1063', 'l']

Output: 41058


Input: Consider Input: 4, 7, ['8379', 'J', '4699', 'l', 'V', 'Y', 'M', '6969', 'x', '2795', '267', '7657', 'p', '8665']


Output: 0