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.

[EX Q]: 2, 5, ['601', '9381', '2073', '5113', '9595', 'P', '9499', '7561', '9343']
[EX A]: 26162

[EX Q]: 8, 24, ['2767', '5843', '2707', '2337', '6373', '1267', 'T', 'l', 'N', 'T', 'Z', 'Y', '699', '8411', 'L', '3983', '9083', '4929', '3757', 'R', '2281', '3547', '9079', 'R', '787']
[EX A]: 45769

[EX Q]: 9, 9, ['l', '4007', 'D', '3973', 'x', '7335', '4827', '8855', 'r', '3293']
[EX A]:
0