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: 11, 19, ['Y', 'r', 't', '2931', '9519', '1071', '2417', 'p', 'F', '7509', 'l', '3451', '1907', 'z', 'E', 'n', '1251', 'k', 'p']
Example Output: 6609

Example Input: 9, 16, ['v', '5691', '4973', 'J', 'w', '539', '6957', '9953', 'L', 'c', '5879', 'b', 'g', '6681', 'C', '753', '5835', '1023', 'w', '5713', '159', 'X', 'z', 'i', '8379', '9753', '195', 'X']
Example Output: 13313

Example Input: 2, 3, ['i', 'S', 'T', '1917', 'o', '247', 'n', 'S', 'S', '5209', 'K', '6689', '3689', 'p', '6195']
Example Output:
0