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: 14, 20, ['4221', '2381', 'i', 'm', 'c', 'F', '9703', '3529', 'a', '83', 'D', '1023', 'I', 'c', 'W', '7163', '341', 'w', '7855', '2317', '8989', '3629', 'b']

Output: 17676


Input: Consider Input: 1, 6, ['3309', 'w', '1143', 'D', 'Z', 'd']

Output: 4452


Input: Consider Input: 1, 9, ['X', 'o', '9851', 'C', '3243', 'i', 'D', 'C', '5507', '8871']


Output: 18601