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, 14, ['707', 'L', '8503', 'x', 'Y', '921', '8415', '6449', '5711', 'd', '591', 'd', '3827', '5569', 'g', 'U', 'v', '7781', 'E', 'z', '4751', '8541', 'c', 'P', '8037', 'X']

Output: 31483


Input: Consider Input: 1, 4, ['7771', '6243', 's', 'n', '4775']

Output: 14014


Input: Consider Input: 5, 12, ['6555', 'i', '2849', 'G', 'E', 'z', 'C', 'K', 'x', '9077', '4067', 'F', '403', '5197', 'D', '5707', '8893', '5901', '1309', 'E']


Output: 13144