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: 5, 18, ['T', '7117', '7067', 't', '7083', '5711', '6735', 's', '4879', '2553', 'a', 'z', 'Q', '4759', '6243', 'k', 'V', '7803', '2489', 'j', '9449', '8017', '9739', 'F', '1557']
Example Output: 45766

Example Input: 1, 2, ['1811', 'K', '3343', 'e']
Example Output: 1811

Example Input: 9, 18, ['445', 't', '5865', '7493', '9007', 'A', '3455', 'g', 'd', '5753', 'Y', '5055', 'o', 'M', '8645', 'r', '4033', 'N', '4679', 'T']
Example Output:
23486