#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s = "1";
int n,k;
ll e;
void mul(ll a){
    string t = s;
    ll x = 0;
	int l = t.size();
    for(int i = l - 1;i >= 0;--i){
        ll p = (t[i] - '0') * a + x;
        t[i] = p % 10 + '0';
        x = p / 10;
    }
    while(x > 0){
        t = char((x % 10) + '0') + t;
        x /= 10;
    }
    s = t;
    return ;
}
int main(){
    cin >> n >> k;
    for(int i = 1;i <= n;++i){
        cin >> e;
        mul(e);
        if(s.size() > k){
            s = "1";
        }
    }
    cout << s;
    return 0;
}