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, 19, ['6719', 'c', 'S', '3259', '1287', 'u', '9251', '2183', '4821', '9449', 'I', 'P', 'i', '7597', '8141', 'G', 'j', '8587', '7245', 'G', 'O', 'o', '9479']
[EX A]: 57274

[EX Q]: 2, 17, ['J', '505', '9301', '6263', 'W', '901', '1441', '595', '7877', '4597', '409', 'j', 'Y', 'P', '4737', 'f', 'H', 'u', 'B', 'V', '6661', 'e']
[EX A]: 36626

[EX Q]: 2, 9, ['g', 'R', '6039', 'T', '4905', '8437', 'a', '3039', 'Z', 'P', 'O', '4249', 'W', '8933', 'h', 'w', '9001', '4459', 'W', '8713', '9369', '6397', '7693']
[EX A]:
22420