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]: 11, 20, ['7193', 't', 'v', '6817', '3505', 'u', '6051', '4027', 'G', '8381', 'Z', 'T', 'q', 'M', 'o', '7645', '75', 'J', 'U', 'N', '3885', 'y', 'C', 'q', '5109', 'f', 'v']
[EX A]: 7720

[EX Q]: 5, 6, ['W', '4759', '7861', '321', '5573', 'O', 'N', '157']
[EX A]: 5573

[EX Q]: 12, 16, ['4527', 'H', '7181', 'h', '7549', '2831', '4495', 'Z', '3121', 'W', '2723', '5723', '4883', 'h', 'r', '1323', '8591']
[EX A]:
11929