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]: 6, 7, ['6635', '1537', 'F', 'h', '7965', 'K', '5231', 'K', '3089']
[A]: 5231


[Q]: 6, 15, ['U', 'G', '4461', '7163', '5651', 'x', '4017', 'W', '7237', 'k', 'b', 'k', 'h', '9147', 'T', '9035', '537', 'Y', 'Q']
[A]: 20401


[Q]: 1, 19, ['5857', '4581', '8105', '8127', '947', '7965', 'n', '8261', '2773', '1357', 'R', '1331', 'j', '7569', '3895', '7657', 's', 'L', '9207', 'e', 'B', '6219', '6289', 'j', 'j', '5241']
[A]:
77632