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: 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']
Example Output: 16056

Example Input: 1, 2, ['8895', 't', '5739']
Example Output: 8895

Example Input: 18, 28, ['6217', '2855', '2637', '1681', '127', '8823', 'A', '4347', '3527', '1955', 'P', '5681', 'L', '2455', 'e', 'B', 'T', 'q', 'v', '2871', 'D', '8147', '7063', 'H', '3947', 'Y', 'O', '4997', '9171']
Example Output:
27025