///17571@nith.ac.in @Ankit Verma
#include <bits/stdc++.h>
using namespace std;
#define ff          first
#define ss          second
#define pb          push_back
#define MP          make_pair
#define int         long long
#define ll          long long
#define inf         0x3f3f3f3f
#define MOD         1000000007
#define ld          long double
#define eb          emplace_back
#define pii         pair<int,int>
#define ull         unsigned long long
#define all(v)      v.begin(), v.end()
#define f(i,x,n)    for(int i=x;i<n;i++)
#define fr(i,x,n)   for(int i=x;i>=n;i--)
#define fastio      ios::sync_with_stdio(false)

#define n_l '\n'
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define debug(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl

void IO() {
    #ifndef ONLINE_JUDGE
        freopen("/home/ankit/Desktop/io/input.txt", "r", stdin);
        freopen("/home/ankit/Desktop/io/output.txt", "w", stdout);
    #endif
}
int32_t main() {
   //IO();
    fastio;
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n; cin >> n;
    vector <int> ar(n + 1);
    for (int i = 1; i <= n; i++) {
    	cin >> ar[i];
    }
    int res = 1;
    sort(all(ar));
    for (int i = 1; i <= n; i++) {
    	res *= (ar[i] - ar[i - 1] + 1 + MOD);
    	res %= MOD;
    }	
    cout << res << endl;
    
    return 0;
}

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
static const ll MOD = 1e9 + 7;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  
  string s;
  int k;
  cin >> s >> k;
  
  vector<vector<ll>> dp(s.size(), vector<ll>(17));
  set<char> st;
  for (auto nc : {'1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F'}) {
    if (nc == s[0]) break;
    dp[0][1]++;
  }
  st.insert(s[0]);
  
  for (int i = 0; i < s.size() - 1; i++) {
    for (int j = 1; j <= 16; j++) {
      dp[i + 1][j] += dp[i][j] * (ll) j;
      dp[i + 1][j] %= MOD;
      if (j < 16) {
        dp[i + 1][j + 1] += dp[i][j] * (ll) (16 - j);
        dp[i + 1][j + 1] %= MOD;
      }
    }
    
    dp[i + 1][1] += (ll) 15;
    dp[i + 1][1] %= MOD;
    
//    int next;
//    if ('0' <= s[i] && s[i + 1] <= '9') next = (int) (s[i] - '0');
//    else next = 10 + (int) (s[i] - 'A');
    for (auto nc : {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F'}) {
      if (nc == s[i + 1]) break;
      if (st.find(nc) == st.end()) {
        dp[i + 1][st.size() + 1]++;
        dp[i + 1][st.size() + 1] %= MOD;
      }
      else {
        dp[i + 1][st.size()]++;
        dp[i + 1][st.size()] %= MOD;
      }
    }
    
    st.insert(s[i + 1]);
  }
  
  ll ans = dp[s.size() - 1][k];
  
  // Is N composed of K characters?
  if (st.size() == k) ans++;
  
  if (ans >= MOD) ans -= MOD;
  
  cout << ans << '\n';
}