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]: 19, 19, ['4147', '1103', '5749', 'c', '5103', '3491', '4511', '197', 'T', '1601', 'J', 'c', '1309', 'a', '607', 'p', 'C', '9473', '5221', 'D', 'U', 'O', '5013']
[EX A]: 5221

[EX Q]: 1, 7, ['Y', 'n', '8993', 'X', '7211', 's', 't', 'R', 'm', 'L', '9559', 'K', 'j', '791']
[EX A]: 16204

[EX Q]: 4, 9, ['8095', 'c', '8163', 'k', 'U', 'R', '6801', 'H', '9985', 'f', 'l', '3569', 'g', '3675']
[EX A]:
16786