#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
bool cmp(int x, int y) { return x > y; }
int main () {
int X, Y, n = 0, N, a = 0, c = 1;
scanf("%d%d", &X, &N);
Y = X;
while (Y != 0) {
Y /= 10;
n++;
}
int *myints = new int[n];
for (int i = n-1; i >= 0; i--) {
myints[i] = X%10;
X /= 10;
}
std::sort (myints,myints+n);
do {
if (myints[0] != 0) {
for(int i=n-1; i>=0; i--){
a += myints[i]*c;
c *= 10;
}
if (a % N == 0) {
cout << a;
return 0;
}
a = 0;
c = 1;
}
} while ( std::next_permutation(myints,myints+n) );
delete [] myints;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8c3RkaW8uaD4KCnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpib29sIGNtcChpbnQgeCwgaW50IHkpIHsgcmV0dXJuIHggPiB5OyB9IAoKaW50IG1haW4gKCkgewoJaW50IFgsIFksIG4gPSAwLCBOLCBhID0gMCwgYyA9IDE7CglzY2FuZigiJWQlZCIsICZYLCAmTik7CglZID0gWDsKCQoJd2hpbGUgKFkgIT0gMCkgewoJCVkgLz0gMTA7CgkJbisrOwoJfQoKCWludCAqbXlpbnRzID0gbmV3IGludFtuXTsKCglmb3IgKGludCBpID0gbi0xOyBpID49IDA7IGktLSkgewoJCW15aW50c1tpXSA9IFglMTA7CQkKCQlYIC89IDEwOwoJfSAJCgoJc3RkOjpzb3J0IChteWludHMsbXlpbnRzK24pOwoJCglkbyB7CgkJaWYgKG15aW50c1swXSAhPSAwKSB7CgkJCWZvcihpbnQgaT1uLTE7IGk+PTA7IGktLSl7CgkJCQlhICs9IG15aW50c1tpXSpjOwoJCQkJYyAqPSAxMDsKCQkJfQoKCQkJaWYgKGEgJSBOID09IDApIHsKCQkJCWNvdXQgPDwgYTsJCQkJCgkJCQkKCQkJCXJldHVybiAwOwoJCQl9CgoJCQlhID0gMDsKCQkJYyA9IDE7CgoJCX0KCX0gd2hpbGUgKCBzdGQ6Om5leHRfcGVybXV0YXRpb24obXlpbnRzLG15aW50cytuKSApOwoKCgkKCglkZWxldGUgW10gbXlpbnRzOwoKCXJldHVybiAwOwp9