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: 14, 18, ['y', '4021', '9011', '3447', '6467', '5599', 'T', 'g', '1441', 'e', '2857', '7251', 'D', '619', '6413', '3145', '9355', 'O', 'Z', '6521', '5005', 'Q']
Example Output: 19532

Example Input: 1, 3, ['p', '5665', '3001']
Example Output: 8666

Example Input: 4, 17, ['P', '8445', '6971', '9687', '8061', '1495', '5865', '7417', '1411', 'J', 'a', 'l', '5269', 'R', '9813', '1019', 'T', 'T', '7263', 'y', 'x', 'Q', 'n', 't', '6721', '1225', 'f', 'U', 'j']
Example Output:
50037