Source code in the setl programming language

program minimum_multiple_of_m_where_digit_sum_equals_m;
    loop for n in [1..70] do
        putchar(lpad(str minmult n, 9));
        if n mod 10=0 then print; end if;
    end loop;

    op minmult(m);
        n := 1;
        (while digsum(n*m) /= m) n +:= 1; end;
        return n;
    end op;

    op digsum(n);
        return +/[[n mod 10, n div:=10](1) : until n=0];
    end op;
end program;