Find all two-digit numbers that are divisible by m or contain m. Pascal language

Condition:

if ((number i is divisible by m without remainder – i is divisible by m)

or (the number of tens in the number i is equal to m – the first digit)

or (the remainder after dividing i by 10 is m – the number of ones))

then print the number i.

program number_m;

var i, m: integer;

begin

writeln (‘Enter a number’);

readln (m);

for i: = 10 to 99 do

if ((i mod m = 0) or (i div 10 = m) or (i mod 10 = m)) then write (i: 3)

end.