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]: 5, 9, ['1523', 'C', 'd', 'I', '6913', '5553', '2769', '767', 'v', '231', 'I', 'p', '9033', 'H', '2007', 'g', '5837', 'Z']
[EX A]: 16002

[EX Q]: 3, 20, ['u', '5631', '6297', 's', '5839', 'l', '6967', '4097', '4643', '9645', 'q', 'i', '2963', 'R', '9539', 'j', 'M', '5607', '2651', '907', 'z', 'C', 'O']
[EX A]: 59155

[EX Q]: 11, 13, ['L', '6235', '7211', 'G', 'A', '2255', '1443', '9559', 'j', 'F', 'L', '919', '7831', '7407', 'o', '6591', '4829', 'z', 'o', 'u', '5975', 'F', '9219', '775', '5279']
[EX A]:
8750