// Slower C++ solution:
/**

 *    author:  tourist

 *    created: 28.11.2019 09:33:49       

**/

#undef _GLIBCXX_DEBUG



#include <bits/stdc++.h>



using namespace std;



template <typename A, typename B>

string to_string(pair<A, B> p);



template <typename A, typename B, typename C>

string to_string(tuple<A, B, C> p);



template <typename A, typename B, typename C, typename D>

string to_string(tuple<A, B, C, D> p);



string to_string(const string& s) {

  return '"' + s + '"';

}



string to_string(const char* s) {

  return to_string((string) s);

}



string to_string(bool b) {

  return (b ? "true" : "false");

}



string to_string(vector<bool> v) {

  bool first = true;

  string res = "{";

  for (int i = 0; i < static_cast<int>(v.size()); i++) {

    if (!first) {

      res += ", ";

    }

    first = false;

    res += to_string(v[i]);

  }

  res += "}";

  return res;

}



template <size_t N>

string to_string(bitset<N> v) {

  string res = "";

  for (size_t i = 0; i < N; i++) {

    res += static_cast<char>('0' + v[i]);

  }

  return res;

}



template <typename A>

string to_string(A v) {

  bool first = true;

  string res = "{";

  for (const auto &x : v) {

    if (!first) {

      res += ", ";

    }

    first = false;

    res += to_string(x);

  }

  res += "}";

  return res;

}



template <typename A, typename B>

string to_string(pair<A, B> p) {

  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";

}



template <typename A, typename B, typename C>

string to_string(tuple<A, B, C> p) {

  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";

}



template <typename A, typename B, typename C, typename D>

string to_string(tuple<A, B, C, D> p) {

  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";

}



void debug_out() { cerr << endl; }



template <typename Head, typename... Tail>

void debug_out(Head H, Tail... T) {

  cerr << " " << to_string(H);

  debug_out(T...);

}



#ifdef LOCAL

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

#else

#define debug(...) 42

#endif



template <typename T>

T inverse(T a, T m) {

  T u = 0, v = 1;

  while (a != 0) {

    T t = m / a;

    m -= t * a; swap(a, m);

    u -= t * v; swap(u, v);

  }

  assert(m == 1);

  return u;

}



template <typename T>

class Modular {

 public:

  using Type = typename decay<decltype(T::value)>::type;



  constexpr Modular() : value() {}

  template <typename U>

  Modular(const U& x) {

    value = normalize(x);

  }



  template <typename U>

  static Type normalize(const U& x) {

    Type v;

    if (-mod() <= x && x < mod()) v = static_cast<Type>(x);

    else v = static_cast<Type>(x % mod());

    if (v < 0) v += mod();

    return v;

  }



  const Type& operator()() const { return value; }

  template <typename U>

  explicit operator U() const { return static_cast<U>(value); }

  constexpr static Type mod() { return T::value; }



  Modular& operator+=(const Modular& other) { if ((value += other.value) >= mod()) value -= mod(); return *this; }

  Modular& operator-=(const Modular& other) { if ((value -= other.value) < 0) value += mod(); return *this; }

  template <typename U> Modular& operator+=(const U& other) { return *this += Modular(other); }

  template <typename U> Modular& operator-=(const U& other) { return *this -= Modular(other); }

  Modular& operator++() { return *this += 1; }

  Modular& operator--() { return *this -= 1; }

  Modular operator++(int) { Modular result(*this); *this += 1; return result; }

  Modular operator--(int) { Modular result(*this); *this -= 1; return result; }

  Modular operator-() const { return Modular(-value); }



  template <typename U = T>

  typename enable_if<is_same<typename Modular<U>::Type, int>::value, Modular>::type& operator*=(const Modular& rhs) {

#ifdef _WIN32

    uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);

    uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x), d, m;

    asm(

      "divl %4; \n\t"

      : "=a" (d), "=d" (m)

      : "d" (xh), "a" (xl), "r" (mod())

    );

    value = m;

#else

    value = normalize(static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value));

#endif

    return *this;

  }

  template <typename U = T>

  typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value, Modular>::type& operator*=(const Modular& rhs) {

    int64_t q = static_cast<int64_t>(static_cast<long double>(value) * rhs.value / mod());

    value = normalize(value * rhs.value - q * mod());

    return *this;

  }

  template <typename U = T>

  typename enable_if<!is_integral<typename Modular<U>::Type>::value, Modular>::type& operator*=(const Modular& rhs) {

    value = normalize(value * rhs.value);

    return *this;

  }



  Modular& operator/=(const Modular& other) { return *this *= Modular(inverse(other.value, mod())); }



  template <typename U>

  friend const Modular<U>& abs(const Modular<U>& v) { return v; }



  template <typename U>

  friend bool operator==(const Modular<U>& lhs, const Modular<U>& rhs);



  template <typename U>

  friend bool operator<(const Modular<U>& lhs, const Modular<U>& rhs);



  template <typename U>

  friend std::istream& operator>>(std::istream& stream, Modular<U>& number);



 private:

  Type value;

};



template <typename T> bool operator==(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value == rhs.value; }

template <typename T, typename U> bool operator==(const Modular<T>& lhs, U rhs) { return lhs == Modular<T>(rhs); }

template <typename T, typename U> bool operator==(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) == rhs; }



template <typename T> bool operator!=(const Modular<T>& lhs, const Modular<T>& rhs) { return !(lhs == rhs); }

template <typename T, typename U> bool operator!=(const Modular<T>& lhs, U rhs) { return !(lhs == rhs); }

template <typename T, typename U> bool operator!=(U lhs, const Modular<T>& rhs) { return !(lhs == rhs); }



template <typename T> bool operator<(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value < rhs.value; }



template <typename T> Modular<T> operator+(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }

template <typename T, typename U> Modular<T> operator+(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) += rhs; }

template <typename T, typename U> Modular<T> operator+(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }



template <typename T> Modular<T> operator-(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }

template <typename T, typename U> Modular<T> operator-(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) -= rhs; }

template <typename T, typename U> Modular<T> operator-(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }



template <typename T> Modular<T> operator*(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }

template <typename T, typename U> Modular<T> operator*(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) *= rhs; }

template <typename T, typename U> Modular<T> operator*(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }



template <typename T> Modular<T> operator/(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }

template <typename T, typename U> Modular<T> operator/(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) /= rhs; }

template <typename T, typename U> Modular<T> operator/(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }



template<typename T, typename U>

Modular<T> power(const Modular<T>& a, const U& b) {

  assert(b >= 0);

  Modular<T> x = a, res = 1;

  U p = b;

  while (p > 0) {

    if (p & 1) res *= x;

    x *= x;

    p >>= 1;

  }

  return res;

}



template <typename T>

bool IsZero(const Modular<T>& number) {

  return number() == 0;

}



template <typename T>

string to_string(const Modular<T>& number) {

  return to_string(number());

}



template <typename T>

std::ostream& operator<<(std::ostream& stream, const Modular<T>& number) {

  return stream << number();

}



template <typename T>

std::istream& operator>>(std::istream& stream, Modular<T>& number) {

  typename common_type<typename Modular<T>::Type, int64_t>::type x;

  stream >> x;

  number.value = Modular<T>::normalize(x);

  return stream;

}



/*

using ModType = int;



struct VarMod { static ModType value; };

ModType VarMod::value;

ModType& md = VarMod::value;

using Mint = Modular<VarMod>;

*/



constexpr int md = (int) 1e9 + 7;

using Mint = Modular<std::integral_constant<decay<decltype(md)>::type, md>>;



template <typename T>

vector<T> operator*(const vector<T>& a, const vector<T>& b) {

  if (a.empty() || b.empty()) {

    return {};

  }

  vector<T> c(a.size() + b.size() - 1, 0);

  for (int i = 0; i < (int) a.size(); i++) {

    for (int j = 0; j < (int) b.size(); j++) {

      c[i + j] += a[i] * b[j];

    }

  }

  return c;

}



template <typename T>

vector<T>& operator*=(vector<T>& a, const vector<T>& b) {

  return a = a * b;

}



class dsu {

 public:

  vector<int> p;

  int n;



  dsu(int _n) : n(_n) {

    p.resize(n);

    iota(p.begin(), p.end(), 0);

  }



  inline int get(int x) {

    return (x == p[x] ? x : (p[x] = get(p[x])));

  }



  inline bool unite(int x, int y) {

    x = get(x);

    y = get(y);

    if (x != y) {

      p[x] = y;

      return true;

    }

    return false;

  }

};



int main() {

  ios::sync_with_stdio(false);

  cin.tie(0);

  int n, q;

  cin >> n >> q;

  vector<int> l(q), r(q);

  for (int i = 0; i < q; i++) {

    cin >> l[i] >> r[i];

    --l[i];

  }

  set<int> s;

  for (int i = 0; i < q; i++) {

    s.insert(l[i]);

    s.insert(r[i]);

  }

  vector<int> xs(s.begin(), s.end());

  int sz = (int) xs.size();

  dsu d(sz);

  for (int i = 0; i < q; i++) {

    int x = (int) (lower_bound(xs.begin(), xs.end(), l[i]) - xs.begin());

    int y = (int) (lower_bound(xs.begin(), xs.end(), r[i]) - xs.begin());

    d.unite(x, y);

  }

  vector<int> comp(sz, -1);

  int cnt = 0;

  for (int i = 0; i < sz; i++) {

    for (int j = 0; j < i; j++) {

      if (d.get(i) == d.get(j)) {

        comp[i] = comp[j];

        break;

      }

    }

    if (comp[i] == -1) {

      comp[i] = cnt++;

    }

  }

  Mint ans = 1;

  vector<Mint> modifier(1 << cnt, 1);

  for (int i = 0; i < sz - 1; i++) {

    Mint cur = (power(Mint(10), xs[i + 1] - xs[i]) - 1) / 9;

    ans *= cur;

    int x = comp[i];

    int y = comp[i + 1];

    for (int t = 0; t < (1 << cnt); t++) {

      if ((t & (1 << x)) && (t & (1 << y))) {

        modifier[t] *= (cur + 1) / cur;

      }

    }

  }

  auto DisCon = [&](const vector<Mint>& a, const vector<Mint>& b) {

    vector<vector<Mint>> one(32, vector<Mint>(1 << cnt, 0));

    vector<vector<Mint>> two(32, vector<Mint>(1 << cnt, 0));

    for (int t = 0; t < (1 << cnt); t++) {

      one[__builtin_popcount(t)][t] = a[t];

      two[__builtin_popcount(t)][t] = b[t];

    }

    for (int i = 0; i < 32; i++) {

      for (int j = 0; j < cnt; j++) {

        for (int t = 0; t < (1 << cnt); t++) {

          if (t & (1 << j)) {

            one[i][t] += one[i][t ^ (1 << j)];

            two[i][t] += two[i][t ^ (1 << j)];

          }

        }

      }

    }

    vector<Mint> col1(32), col2(32);

    for (int t = 0; t < (1 << cnt); t++) {

      for (int i = 0; i < 32; i++) {

        col1[i] = one[i][t];

        col2[i] = two[i][t];

        one[i][t] = 0;

      }

      for (int i = 0; i < 32; i++) {

        for (int j = 0; i + j < 32; j++) {

          one[i + j][t] += col1[i] * col2[j];

        }

      }

    }

    for (int i = 0; i < 32; i++) {

      for (int j = 0; j < cnt; j++) {

        for (int t = 0; t < (1 << cnt); t++) {

          if (t & (1 << j)) {

            one[i][t] -= one[i][t ^ (1 << j)];

          }

        }

      }

    }

    vector<Mint> three(1 << cnt);

    for (int t = 0; t < (1 << cnt); t++) {

      three[t] = one[__builtin_popcount(t)][t];

    }

    return three;

  };

  vector<Mint> dp(1 << cnt, 0);

  dp[0] = 1;

  for (int it = 0; it < 9; it++) {

    dp = DisCon(dp, modifier);

  }

  ans *= dp[(1 << cnt) - 1] / 9;

  ans *= power(Mint(10), n - (xs.back() - xs[0]));

  cout << ans << '\n';

  return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.107403989111947x):
/**

 *    author:  tourist

 *    created: 28.11.2019 09:33:49       

**/

#undef _GLIBCXX_DEBUG



#include <bits/stdc++.h>



using namespace std;



template <typename A, typename B>

string to_string(pair<A, B> p);



template <typename A, typename B, typename C>

string to_string(tuple<A, B, C> p);



template <typename A, typename B, typename C, typename D>

string to_string(tuple<A, B, C, D> p);



string to_string(const string& s) {

  return '"' + s + '"';

}



string to_string(const char* s) {

  return to_string((string) s);

}



string to_string(bool b) {

  return (b ? "true" : "false");

}



string to_string(vector<bool> v) {

  bool first = true;

  string res = "{";

  for (int i = 0; i < static_cast<int>(v.size()); i++) {

    if (!first) {

      res += ", ";

    }

    first = false;

    res += to_string(v[i]);

  }

  res += "}";

  return res;

}



template <size_t N>

string to_string(bitset<N> v) {

  string res = "";

  for (size_t i = 0; i < N; i++) {

    res += static_cast<char>('0' + v[i]);

  }

  return res;

}



template <typename A>

string to_string(A v) {

  bool first = true;

  string res = "{";

  for (const auto &x : v) {

    if (!first) {

      res += ", ";

    }

    first = false;

    res += to_string(x);

  }

  res += "}";

  return res;

}



template <typename A, typename B>

string to_string(pair<A, B> p) {

  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";

}



template <typename A, typename B, typename C>

string to_string(tuple<A, B, C> p) {

  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";

}



template <typename A, typename B, typename C, typename D>

string to_string(tuple<A, B, C, D> p) {

  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";

}



void debug_out() { cerr << endl; }



template <typename Head, typename... Tail>

void debug_out(Head H, Tail... T) {

  cerr << " " << to_string(H);

  debug_out(T...);

}



#ifdef LOCAL

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

#else

#define debug(...) 42

#endif



template <typename T>

T inverse(T a, T m) {

  T u = 0, v = 1;

  while (a != 0) {

    T t = m / a;

    m -= t * a; swap(a, m);

    u -= t * v; swap(u, v);

  }

  assert(m == 1);

  return u;

}



template <typename T>

class Modular {

 public:

  using Type = typename decay<decltype(T::value)>::type;



  constexpr Modular() : value() {}

  template <typename U>

  Modular(const U& x) {

    value = normalize(x);

  }



  template <typename U>

  static Type normalize(const U& x) {

    Type v;

    if (-mod() <= x && x < mod()) v = static_cast<Type>(x);

    else v = static_cast<Type>(x % mod());

    if (v < 0) v += mod();

    return v;

  }



  const Type& operator()() const { return value; }

  template <typename U>

  explicit operator U() const { return static_cast<U>(value); }

  constexpr static Type mod() { return T::value; }



  Modular& operator+=(const Modular& other) { if ((value += other.value) >= mod()) value -= mod(); return *this; }

  Modular& operator-=(const Modular& other) { if ((value -= other.value) < 0) value += mod(); return *this; }

  template <typename U> Modular& operator+=(const U& other) { return *this += Modular(other); }

  template <typename U> Modular& operator-=(const U& other) { return *this -= Modular(other); }

  Modular& operator++() { return *this += 1; }

  Modular& operator--() { return *this -= 1; }

  Modular operator++(int) { Modular result(*this); *this += 1; return result; }

  Modular operator--(int) { Modular result(*this); *this -= 1; return result; }

  Modular operator-() const { return Modular(-value); }



  template <typename U = T>

  typename enable_if<is_same<typename Modular<U>::Type, int>::value, Modular>::type& operator*=(const Modular& rhs) {

#ifdef _WIN32

    uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);

    uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x), d, m;

    asm(

      "divl %4; \n\t"

      : "=a" (d), "=d" (m)

      : "d" (xh), "a" (xl), "r" (mod())

    );

    value = m;

#else

    value = normalize(static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value));

#endif

    return *this;

  }

  template <typename U = T>

  typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value, Modular>::type& operator*=(const Modular& rhs) {

    int64_t q = static_cast<int64_t>(static_cast<long double>(value) * rhs.value / mod());

    value = normalize(value * rhs.value - q * mod());

    return *this;

  }

  template <typename U = T>

  typename enable_if<!is_integral<typename Modular<U>::Type>::value, Modular>::type& operator*=(const Modular& rhs) {

    value = normalize(value * rhs.value);

    return *this;

  }



  Modular& operator/=(const Modular& other) { return *this *= Modular(inverse(other.value, mod())); }



  template <typename U>

  friend const Modular<U>& abs(const Modular<U>& v) { return v; }



  template <typename U>

  friend bool operator==(const Modular<U>& lhs, const Modular<U>& rhs);



  template <typename U>

  friend bool operator<(const Modular<U>& lhs, const Modular<U>& rhs);



  template <typename U>

  friend std::istream& operator>>(std::istream& stream, Modular<U>& number);



 private:

  Type value;

};



template <typename T> bool operator==(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value == rhs.value; }

template <typename T, typename U> bool operator==(const Modular<T>& lhs, U rhs) { return lhs == Modular<T>(rhs); }

template <typename T, typename U> bool operator==(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) == rhs; }



template <typename T> bool operator!=(const Modular<T>& lhs, const Modular<T>& rhs) { return !(lhs == rhs); }

template <typename T, typename U> bool operator!=(const Modular<T>& lhs, U rhs) { return !(lhs == rhs); }

template <typename T, typename U> bool operator!=(U lhs, const Modular<T>& rhs) { return !(lhs == rhs); }



template <typename T> bool operator<(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value < rhs.value; }



template <typename T> Modular<T> operator+(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }

template <typename T, typename U> Modular<T> operator+(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) += rhs; }

template <typename T, typename U> Modular<T> operator+(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }



template <typename T> Modular<T> operator-(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }

template <typename T, typename U> Modular<T> operator-(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) -= rhs; }

template <typename T, typename U> Modular<T> operator-(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }



template <typename T> Modular<T> operator*(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }

template <typename T, typename U> Modular<T> operator*(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) *= rhs; }

template <typename T, typename U> Modular<T> operator*(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }



template <typename T> Modular<T> operator/(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }

template <typename T, typename U> Modular<T> operator/(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) /= rhs; }

template <typename T, typename U> Modular<T> operator/(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }



template<typename T, typename U>

Modular<T> power(const Modular<T>& a, const U& b) {

  assert(b >= 0);

  Modular<T> x = a, res = 1;

  U p = b;

  while (p > 0) {

    if (p & 1) res *= x;

    x *= x;

    p >>= 1;

  }

  return res;

}



template <typename T>

bool IsZero(const Modular<T>& number) {

  return number() == 0;

}



template <typename T>

string to_string(const Modular<T>& number) {

  return to_string(number());

}



template <typename T>

std::ostream& operator<<(std::ostream& stream, const Modular<T>& number) {

  return stream << number();

}



template <typename T>

std::istream& operator>>(std::istream& stream, Modular<T>& number) {

  typename common_type<typename Modular<T>::Type, int64_t>::type x;

  stream >> x;

  number.value = Modular<T>::normalize(x);

  return stream;

}



/*

using ModType = int;



struct VarMod { static ModType value; };

ModType VarMod::value;

ModType& md = VarMod::value;

using Mint = Modular<VarMod>;

*/



constexpr int md = (int) 1e9 + 7;

using Mint = Modular<std::integral_constant<decay<decltype(md)>::type, md>>;



class dsu {

 public:

  vector<int> p;

  int n;



  dsu(int _n) : n(_n) {

    p.resize(n);

    iota(p.begin(), p.end(), 0);

  }



  inline int get(int x) {

    return (x == p[x] ? x : (p[x] = get(p[x])));

  }



  inline bool unite(int x, int y) {

    x = get(x);

    y = get(y);

    if (x != y) {

      p[x] = y;

      return true;

    }

    return false;

  }

};



int main() {

  ios::sync_with_stdio(false);

  cin.tie(0);

  int n, q;

  cin >> n >> q;

  vector<int> l(q), r(q);

  for (int i = 0; i < q; i++) {

    cin >> l[i] >> r[i];

    --l[i];

  }

  set<int> s;

  for (int i = 0; i < q; i++) {

    s.insert(l[i]);

    s.insert(r[i]);

  }

  vector<int> xs(s.begin(), s.end());

  int sz = (int) xs.size();

  dsu d(sz);

  for (int i = 0; i < q; i++) {

    int x = (int) (lower_bound(xs.begin(), xs.end(), l[i]) - xs.begin());

    int y = (int) (lower_bound(xs.begin(), xs.end(), r[i]) - xs.begin());

    d.unite(x, y);

  }

  vector<int> comp(sz, -1);

  int cnt = 0;

  for (int i = 0; i < sz; i++) {

    for (int j = 0; j < i; j++) {

      if (d.get(i) == d.get(j)) {

        comp[i] = comp[j];

        break;

      }

    }

    if (comp[i] == -1) {

      comp[i] = cnt++;

    }

  }

  Mint ans = 1;

  vector<Mint> modifier(1 << cnt, 1);

  for (int i = 0; i < sz - 1; i++) {

    Mint cur = (power(Mint(10), xs[i + 1] - xs[i]) - 1) / 9;

    ans *= cur;

    Mint coeff = (cur + 1) / cur;

    int x = comp[i];

    int y = comp[i + 1];

    int ct = (1 << cnt) - 1 - ((1 << x) | (1 << y));

    int t = ct;

    while (true) {

      modifier[t | (1 << x) | (1 << y)] *= coeff;

      if (t == 0) {

        break;

      }

      t = (t - 1) & ct;

    }

  }

  Mint dp[1 << cnt][cnt + 1];

  memset(dp, 0, sizeof(dp));

  for (int t = 0; t < (1 << cnt); t++) {

    dp[t][__builtin_popcount(t)] = modifier[t];

  }

  for (int j = 0; j < cnt; j++) {

    for (int t = 0; t < (1 << cnt); t++) {

      if (t & (1 << j)) {

        for (int i = 0; i <= cnt; i++) {

          dp[t][i] += dp[t ^ (1 << j)][i];

        }

      }

    }

  }

  vector<Mint> row(cnt + 1);

  vector<Mint> new_row(cnt + 1);

  for (int t = 0; t < (1 << cnt); t++) {

    for (int i = 0; i <= cnt; i++) {

      row[i] = dp[t][i];

    }

    for (int it = 0; it < 3; it++) {

      fill(new_row.begin(), new_row.end(), 0);

      for (int i = 0; i <= cnt; i++) {

        for (int j = 0; j <= cnt - i; j++) {

          new_row[i + j] += row[i] * row[j];

        }

      }

      swap(row, new_row);

    }

    for (int i = cnt; i >= 0; i--) {

      for (int j = 1; i + j <= cnt; j++) {

        dp[t][i + j] += dp[t][i] * row[j];

      }

      dp[t][i] *= row[0];

    }

  }

  for (int j = 0; j < cnt; j++) {

    for (int t = 0; t < (1 << cnt); t++) {

      if (t & (1 << j)) {

        dp[t][cnt] -= dp[t ^ (1 << j)][cnt];

      }

    }

  }

  ans *= dp[(1 << cnt) - 1][cnt] / 9;

  ans *= power(Mint(10), n - (xs.back() - xs[0]));

  cout << ans << '\n';

  return 0;

}