Calculate the inverse modulus The task:
Output a value for x, where a mod x = b for two given values a,b.
Assumption

a and b will always be positive integers
There won't always be a solution for x
If multiple solutions exist, output at least one of them.
If there aren't any solutions, output nothing or some indication that no solutions exist.
Built-ins are allowed (not as fun as other mathematical approaches)
Outputs are always integers

Examples
A, B &gt;&gt; POSSIBLE OUTPUTS

5, 2 &gt;&gt; 3
9, 4 &gt;&gt; 5
8, 2 &gt;&gt; 3, 6
6, 6 &gt;&gt; 7, (ANY NUMBER &gt; 6)
8, 7 &gt;&gt; NO SOLUTION
2, 4 &gt;&gt; NO SOLUTION
8, 5 &gt;&gt; NO SOLUTION
10,1 &gt;&gt; 3, 9

This is code-golf, so lowest bytes wins.
JavaScript, 28 27 26 24 23 bytes



a=&gt;b=&gt;(a-=b)?a&gt;b&amp;&amp;a:b+1


Try it online!

false indicates no solution.

-1 thanks @Arnauld