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, 7, ['k', 'F', 'I', '1481', 'v', '5085', 'V', '9661', '525']

Output: 5085


Input: Consider Input: 12, 24, ['4727', 'q', 'L', '969', '6799', '6223', '8967', 'e', '8589', '4399', '3237', 'M', '5323', '1477', 'n', '1553', 'r', 'J', '4789', 'h', 'J', 'M', 'g', 's', 'N', 'O']

Output: 13142


Input: Consider Input: 4, 20, ['G', '1335', 'V', 'K', '5061', 'r', 'M', '2981', '2811', 'H', 'F', 'X', '7831', 'u', 'D', '2989', 'a', '6945', '3517', '3783', 'D', 'k', 'o', '9185', '6397', 'p', 'Y']


Output: 35918