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.

[Q]: 16, 20, ['7527', '5121', 'Q', '4585', '9735', 'Y', 'e', 'p', '755', '8605', 'B', 'O', 'X', '3887', 'M', '8347', '2391', 'v', 'F', '5509', 'e', 'g', 'm', 'j', 'P', 'J']
[A]: 16247


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


[Q]: 2, 5, ['4509', '5795', '4995', 'l', '5801', '7347', '2191', '659']
[A]:
16591