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: 1, 14, ['9503', '5983', '143', 'j', '9227', 'g', 'X', '5995', '6623', 'k', 'q', '1047', '2815', '569', 's', 'D', '4045', 'G', '9707', '6707', '7953', 'R']

Output: 41905


Input: Consider Input: 2, 10, ['f', 'r', 'Z', '1989', '5035', '1623', '9335', '7495', '8663', '2199', '2047', 'o']

Output: 36339


Input: Consider Input: 12, 14, ['6337', 'k', '691', '8519', 'c', 'j', '7167', '7221', 'e', '1917', '3207', '2945', '5623', 'I', '9027', '1095', 'q', '8285']


Output: 8568