Find the Missing Numbers in the Fibonacci Sequence Mod K
Haskell, 70 bytes

Some amount of bytes saved thanks to Esolanging Fruit

8 bytes saved thanks to Laikoni



a=1:scanl(+)1a
f x=[u|u&lt;-[2..x-1],and[mod b x/=u|(_,b)&lt;-zip[1..x^2]a]]


Try it online!