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, 5, ['O', 'T', 'V', '9035', 'L', 't', 'I']

Output: 9035


Input: Consider Input: 7, 12, ['K', '5995', '5183', '67', '563', '9143', 'M', 'H', '2923', '1825', 'y', '373', 'm', 'w', 'x']

Output: 5121


Input: Consider Input: 11, 18, ['G', '895', '1281', '6949', 'Q', 's', '6121', '8445', '8449', '2049', '7947', '6339', '6873', 'v', 'z', 'g', 'l', '3603', 'r', '2447', 'p', '5799', 'b', '6661', '3043', '3991', 'R', 'b', 'l']


Output: 24762