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: 2, 11, ['N', '3963', 'O', 'T', '8551', '3099', '577', '9273', '9849', '2593', '4693', 'A', 'O', '7381', 'o', 'P', 'g', 'H', '3927']

Output: 42598


Input: Consider Input: 1, 10, ['N', 'p', 'z', '6083', 'x', 'x', '3063', 'Y', '7099', '9961', 'k', '7365', 'e', '8629', '9595', '2831', '3649', '3809', 'm']

Output: 26206


Input: Consider Input: 2, 17, ['8805', '6507', 'e', '669', '5087', 's', '9', '5635', '3005', '1761', '3129', '5159', 'H', '7311', '6865', '8143', '455', '6919', 'r', '7297', 'W', 'l', '6375', 'B', 'B']


Output: 53735