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.

Q: 7, 11, ['n', '851', '1155', '5763', 'k', 'f', '3761', '1167', 'E', 'h', '1261']

A: 6189
****
Q: 1, 2, ['t', '9343', 'g']

A: 9343
****
Q: 3, 15, ['1143', '635', '6543', '8957', 'H', '9553', 'A', 'Y', '9993', 'x', 'K', '6875', 'v', '2533', 'b', '8205', '5929', '439', '2881', 'C', 'K', 'y', '6041', '2551', 'r', 'g', 'd', '6831']

A:
44454
****