#include <bits/stdc++.h>
using namespace std;
long long inf;
const double eps = 1e-8;
const double pi = acos(-1.0);
template <class T>
long long chkmin(T &a, T b) {
  return a > b ? a = b, 1 : 0;
}
template <class T>
long long chkmax(T &a, T b) {
  return a < b ? a = b, 1 : 0;
}
template <class T>
T sqr(T a) {
  return a * a;
}
template <class T>
T mmin(T a, T b) {
  return a < b ? a : b;
}
template <class T>
T mmax(T a, T b) {
  return a > b ? a : b;
}
template <class T>
T aabs(T a) {
  return a < 0 ? -a : a;
}
template <class T>
long long dcmp(T a, T b) {
  return a > b;
}
template <long long *a>
long long cmp_a(long long first, long long second) {
  return a[first] < a[second];
}
struct __INIT__ {
  __INIT__() { memset(&inf, 0x3f, sizeof(inf)); }
} __INIT___;
namespace io {
const long long SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c,
                                       qu[55];
long long f, qr;
inline void flush() {
  fwrite(obuf, 1, oS - obuf, stdout);
  oS = obuf;
}
inline void putc(char first) {
  *oS++ = first;
  if (oS == oT) flush();
}
template <typename A>
inline bool read(A &first) {
  for (f = 1, c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                              (iS == iT ? EOF : *iS++))
                            : *iS++);
       c < '0' || c > '9';
       c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    if (c == '-')
      f = -1;
    else if (c == EOF)
      return 0;
  for (first = 0; c <= '9' && c >= '0';
       c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    first = first * 10 + (c & 15);
  first *= f;
  return 1;
}
inline bool read(char &first) {
  while ((first = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                               (iS == iT ? EOF : *iS++))
                            : *iS++)) == ' ' ||
         first == '\n' || first == '\r')
    ;
  return first != EOF;
}
inline bool read(char *first) {
  while ((*first = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                                (iS == iT ? EOF : *iS++))
                             : *iS++)) == '\n' ||
         *first == ' ' || *first == '\r')
    ;
  if (*first == EOF) return 0;
  while (!(*first == '\n' || *first == ' ' || *first == '\r'))
    *(++first) = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                              (iS == iT ? EOF : *iS++))
                           : *iS++);
  *first = 0;
  return 1;
}
template <typename A, typename... B>
inline bool read(A &first, B &...second) {
  return read(first) && read(second...);
}
template <typename A>
inline bool write(A first) {
  if (!first) putc('0');
  if (first < 0) putc('-'), first = -first;
  while (first) qu[++qr] = first % 10 + '0', first /= 10;
  while (qr) putc(qu[qr--]);
  return 0;
}
inline bool write(char first) {
  putc(first);
  return 0;
}
inline bool write(const char *first) {
  while (*first) {
    putc(*first);
    ++first;
  }
  return 0;
}
inline bool write(char *first) {
  while (*first) {
    putc(*first);
    ++first;
  }
  return 0;
}
template <typename A, typename... B>
inline bool write(A first, B... second) {
  return write(first) || write(second...);
}
struct Flusher_ {
  ~Flusher_() { flush(); }
} io_flusher_;
}  // namespace io
using io ::putc;
using io ::read;
using io ::write;
long long a[5005], f[5005], h[5005];
long long l[5005], r[5005];
long long gg;
const long long p = 1000000007;
pair<long long, long long> operator+(pair<long long, long long> a,
                                     pair<long long, long long> b) {
  if (a.first == b.first)
    return make_pair(a.first, (a.second + b.second) % p);
  else
    return mmax(a, b);
}
pair<long long, long long> &operator+=(pair<long long, long long> &a,
                                       pair<long long, long long> b) {
  return a = a + b;
}
long long n, m;
long long s[5005][5];
pair<long long, long long> solve(long long lt) {
  pair<long long, long long> ans = make_pair(!!gg, 1);
  for (long long i = 1; i <= m; ++i)
    if (i != gg) {
      long long hl = 0, hr = 0;
      if (l[i] < lt && f[i] != f[gg]) {
        hl = 1;
      }
      if (r[i] > lt) {
        hr = 1;
      }
      if (hl && hr)
        ++s[f[i]][3];
      else if (hl)
        ++s[f[i]][1];
      else if (hr)
        ++s[f[i]][2];
    }
  for (long long i = 1; i <= n; ++i) {
    pair<long long, long long> mx = make_pair(0, 1);
    if (s[i][1] || s[i][2] || s[i][3])
      mx += make_pair(1, s[i][1] + s[i][2] + s[i][3] + s[i][3]);
    if (!!s[i][1] + !!s[i][2] + !!s[i][3] > 1)
      mx += make_pair(
          2, (s[i][1] * s[i][2] + s[i][1] * s[i][3] + s[i][2] * s[i][3]) % p);
    if (s[i][3] > 1) mx += make_pair(2, (s[i][3] * (s[i][3] - 1)) % p);
    s[i][1] = s[i][2] = s[i][3] = 0;
    ans.first += mx.first;
    ans.second = ans.second * mx.second % p;
  }
  return ans;
}
signed main() {
  read(n, m);
  for (long long i = 1; i <= n; ++i) {
    read(a[i]);
  }
  for (long long i = 1; i <= m; ++i) {
    read(f[i], h[i]);
    long long s = 0;
    for (long long j = 1; j <= n; ++j) {
      if (a[j] == f[i]) ++s;
      if (s == h[i]) {
        l[i] = j;
        break;
      }
    }
    if (s < h[i]) {
      --i;
      --m;
      continue;
    }
    s = 0;
    for (long long j = n; j; --j) {
      if (a[j] == f[i]) ++s;
      if (s == h[i]) {
        r[i] = j;
        break;
      }
    }
  }
  pair<long long, long long> ans = solve(0);
  for (long long i = 1; i <= m; ++i) {
    gg = i;
    ans = ans + solve(l[i]);
  }
  write(ans.first, ' ', ans.second, '\n');
  return 0;
}
