#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
long long n,k;
long long gcd(long a,long b){return a%b==0?b:gcd(b,a%b);
}
int main(){cin>>n>>k;int p=1;while(k--)p*=10;long long ans=0;ans=n*p/gcd(n,p);cout<<ans;return 0;
}

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 int n,m;
 4 int main(){
 5     int ans=-1,l=1,r=101;
 6     int x=0,y=0;
 7     scanf("%d%d",&n,&m);
 8     for(int i=1;i<=m;i++){
 9         cin>>x>>y;
10         if(y==1)l=max(l,x);
11         else{
12             l=max(l,x/y+(x%y==0?0:1));
13             r=min(r,(x-1)/(y-1));
14         }
15     }
16     for(int i=l;i<=r;i++)
17     {
18         int x=n/i+(n%i==0?0:1);
19         if(ans==-1)ans=x;
20         else if(ans!=x){cout<<-1;return 0;}
21     }
22     cout<<ans;
23 }

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 char s[3005];
 4 int n;
 5 int len;
 6 bool flag;
 7 int main(){
 8     scanf("%s",s+1);
 9     n=strlen(s+1);
10     for(int i=1;i<=n;i++){
11     if(s[i]!='a'&&s[i]!='e'&&s[i]!='i'&&s[i]!='o'&&s[i]!='u')
12     {
13         if(len&&s[i-1]!=s[i])flag=1;
14         if(flag&&len>=2)
15         {
16         printf(" ");
17         flag=0;
18         len=1;
19         }
20         else len++;
21         printf("%c",s[i]);
22     }
23     else
24     {
25         flag=0;
26         len=0;
27         printf("%c",s[i]);
28     }
29     }
30     return 0;
31 } 

#include<bits/stdc++.h>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
map<ll,int> m;
map<ll,int> S;
int cnt;
char s[70001][10];
int n,len[70001];
ll work(int i,int j,int k)
{ll sum=0;for(j;j<=k;++j)sum=sum*11+s[i][j]-'0'+1;return sum;
}
int main()
{scanf("%d",&n);for(int i=1;i<=n;++i){scanf("%s",s[i]);len[i]=strlen(s[i]);for(int j=0;j<len[i];++j)for(int k=j;k<len[i];++k)++m[work(i,j,k)];}for(int i=1;i<=n;++i){S.clear();int ans=11,l=0;for(int j=0;j<len[i];++j)for(int k=j;k<len[i];++k){int tmp=work(i,j,k);++S[tmp];if(S[tmp]==m[tmp]) {if(ans>k-j+1) {ans=k-j+1;l=j;}}}for(int j=l;j<=l+ans-1;++j)putchar(s[i][j]);putchar('\n');}
}