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: 14, 14, ['a', 'i', '5431', 'U', '9109', 'm', 'H', '7643', '127', 'a', 'S', '4285', '5625', '5479', '6409', 'U', 'n', 'R']
Example Output: 5479

Example Input: 6, 23, ['s', '5425', '7485', 'I', 'r', 'I', '3943', '4067', '3773', '2459', '1525', '2093', '1103', '7373', 'h', 'j', '3209', 'o', 'Q', 'I', '1295', '4569', '4301', 'C', 'N', '269']
Example Output: 39710

Example Input: 4, 11, ['C', '253', '6205', 'y', '8159', '7271', '4489', 'h', 'B', 'P', 'S', 'j', '9709', 'c', '3189', 'x', '2417', '4253', '955', '7347', '3747', 'y', '8301', '8337']
Example Output:
19919