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: 7, 17, ['n', '1023', '2743', 'r', '5855', 'd', '4425', '3381', 'x', '9609', 'f', 'o', '8513', 'e', '7331', 'N', '7949', 'O']

Output: 41208


Input: Consider Input: 6, 13, ['Z', 'h', 'j', 'i', '4335', 'c', 'A', 'O', 'U', '8173', 'N', 'E', '9187', '9911']

Output: 17360


Input: Consider Input: 4, 9, ['D', '5859', 'j', '561', 'Z', '7889', 'a', 'Y', 'Q', 'B', '3727', '1007', 'c', 'n', 'X', '9275', 'm', '6615', '7423']


Output: 8450