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.

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

[EX Q]: 3, 4, ['2425', 'J', 'x', '8829', 't', '7927', 'R', 'J', '1599', '3149']
[EX A]: 8829

[EX Q]: 4, 5, ['77', '2305', '5601', '6639', 'u', '6213', '8395', '4603', 'E', 'Z', 'P', '4579', '6783', '2167', 'U', 'U', 's', '6633', '6917', 'a', '1813', '1005', '1969', 'L', 'g', 'v', 'j', '9381', 'P', 'y']
[EX A]:
6639