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, 11, ['m', '455', 'u', 'C', 'b', 'N', 'A', 'W', 'M', '3811', 'K', '657', 's', '2839', 'E', 'E', '2733', '6733', 'c', 'P', 'V']
[EX A]: 3811

[EX Q]: 16, 23, ['g', 'p', '7457', 'l', 'a', 'a', 'C', '6307', 'G', '5453', '1165', 'W', '6419', 's', '9445', 'y', 'Y', 'F', '9703', '4049', 'Y', '7173', 's', '7925', 'Z', '4413', 'd', '649']
[EX A]: 20925

[EX Q]: 4, 5, ['3485', '9045', '8977', 'x', '3207', '4033', '7397', 'M', 'x', '745', '9577', '431']
[EX A]:
3207