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: 7, 16, ['l', '1165', '8087', 'M', '6269', '6349', 'R', 'm', 'j', '9437', '3875', 'n', 'R', 'Y', '4427', 'g', '6231', 'm', '1139', '3891', '3773', '1303', 'Y', '7347']
Example Output: 17739

Example Input: 2, 2, ['4965', '6219']
Example Output: 6219

Example Input: 13, 18, ['8541', 'e', '2785', '3705', '6901', '4417', 'H', 'w', '1611', 'C', '4243', 'l', 'o', 'N', '3445', 'B', '6257', '1769']
Example Output:
11471