Calculate the Upper Divmod Task

Given two positive integers (dividend and divisor), calculate the quotient and the remainder.
Normally it would be calculated as e = o*q+r where q*o&lt;=e and 0&lt;=r&lt;o.
For this challenge it still e = o*q+r but q*o&gt;=e and -o&lt;r&lt;=0.
For example e=20 and o=3, normally it would be 20/3 -&gt; 20=3*6+2, since 18&lt;=20 and 0&lt;=2&lt;3. Here it will be 20/3 -&gt; 20=3*7-1 where 21&gt;=20 and -3&lt;-1&lt;=0

Test Cases

Input -&gt; Output
20, 3 -&gt; 7, -1
10, 5 -&gt; 2, 0
7, 20 -&gt; 1, -13
100, 13 -&gt; 8, -4


You don't need to handle o=0.
Python 3,  39 26 bytes

Martin Ender saved 13 bytes



lambda x,y:(-(x//-y),x%-y)


Try it online!

Python 2, 25 bytes

lambda x,y:(-(x/-y),x%-y)


Try it online!