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]: 7, 16, ['l', '1165', '8087', 'M', '6269', '6349', 'R', 'm', 'j', '9437', '3875', 'n', 'R', 'Y', '4427', 'g', '6231', 'm', '1139', '3891', '3773', '1303', 'Y', '7347']
[EX A]: 17739

[EX Q]: 9, 13, ['2813', 's', 'z', 'G', '5927', '4415', 'T', 'c', '7029', 'e', 'o', 'd', '5913', 'y']
[EX A]: 12942

[EX Q]: 3, 16, ['7229', 'q', 'N', '8943', '5189', '9027', 'N', '5479', '3573', '6711', 'h', 'Y', 't', '9391', 'i', '5971', 'T', 'h', '4361', 'm', 'j', 'W', '5103', '8053']
[EX A]:
54284