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.

[Q]: 7, 15, ['1769', 'c', '7895', '8687', '985', '7559', '1109', 'X', 'z', '2309', 'D', 'P', '8655', 'I', 'u', 'z', '9639', '83', '7631']
[A]: 12073


[Q]: 3, 15, ['8815', 'w', '5613', 'm', '9515', '9741', 'O', 'U', '7197', '5237', 'M', '9899', '8289', 'l', '3', '9313', '4467', 'K', 'k', '637']
[A]: 55494


[Q]: 20, 22, ['3933', 'g', '4259', 'c', 'e', '5473', '8603', 'O', 'S', 'a', '8639', 'z', 'W', 'V', '4207', 'A', 't', 's', 'e', '1363', 'R', '1309', '1719', 'P']
[A]:
2672