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: 13, 14, ['7395', '8249', 'n', '935', 'q', 'P', '7179', '2683', '8163', '4747', '2501', 'z', '7601', '7115', 'y', '53']
Example Output: 14716

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: 11, 14, ['Y', '6349', '8287', '2969', '5719', '6209', 'q', 'T', '7249', 'w', 'e', '5559', '7775', '5617', 'L', 'T', '1861', '1583', '6885', 'C', '2601', '8483', 'w', 'r', '6301', 'c']
Example Output:
18951