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.

Example Input: 3, 5, ['X', '8101', 'v', '283', 'v', 'O', 'Y']
Example Output: 283

Example Input: 1, 17, ['4061', '8041', 'V', '5461', '8247', '3119', 'p', '5313', 'T', 'Z', 'D', '8837', 'B', 'a', '6441', 'O', '8311', 'Z', '473', '9', 'Q', 'E', '2957', 'W', '6263', '3917', '9775', 't']
Example Output: 57831

Example Input: 2, 15, ['5943', '31', 'W', '5109', '1875', 'S', '9533', '5651', '4141', '903', '3449', '1615', '5261', 'x', 'L', 'k', '3015', '221', 'A', '4905', 'x', '6621', '2765', '9273', '3303', '2051']
Example Output:
37568