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.

16, 23, ['N', '3357', '919', '9963', 'u', '137', '5633', '2999', 't', '1583', '2217', 'p', '1087', '7219', '61', 'p', 'L', '5745', '4431', 'T', '4369', 'G', '1511', 'p', 'M', '4277', '6683', 'C', 'D']
16056

2, 3, ['3335', '3451', 'f', 'M']
3451

3, 6, ['8975', '1493', 'Q', 'x', '2971', 'K', 'H', 'q', 'v', '2085', 'S']

2971