#pragma GCC optimize ("O3") #pragma GCC target ("avx") #include "bits/stdc++.h" // define macro "/D__MAI" using namespace std; typedef long long int ll; #define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__) #define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout< ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout< ostream& operator <<(ostream &o, const pair p) { o << "(" << p.first << ":" << p.second << ")"; return o; } template inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); } template inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); } template T& maxset(T& to, const T& val) { return to = max(to, val); } template T& minset(T& to, const T& val) { return to = min(to, val); } void bye(string s, int code = 0) { cout << s << endl; exit(0); } mt19937_64 randdev(8901016); inline ll rand_range(ll l, ll h) { return uniform_int_distribution(l, h)(randdev); } #ifdef __MAI #define getchar_unlocked getchar #define putchar_unlocked putchar #endif #ifdef __VSCC #define getchar_unlocked _getchar_nolock #define putchar_unlocked _putchar_nolock #endif namespace { #define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E) class MaiScanner { public: template void input_integer(T& var) { var = 0; T sign = 1; int cc = getchar_unlocked(); for (; cc<'0' || '9'>(int& var) { input_integer(var); return *this; } inline MaiScanner& operator>>(long long& var) { input_integer(var); return *this; } inline MaiScanner& operator>>(string& var) { int cc = getchar_unlocked(); for (; !isvisiblechar(cc); cc = getchar_unlocked()); for (; isvisiblechar(cc); cc = getchar_unlocked()) var.push_back(cc); return *this; } template void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; } }; } MaiScanner scanner; // 隣接頂点を保持する有向グラフ class DGraph { public: size_t n; vector> vertex_to; vector> vertex_from; DGraph(size_t n) :n(n), vertex_to(n), vertex_from(n) {} void connect(int from, int to) { vertex_to[from].emplace_back(to); vertex_from[to].emplace_back(from); } void resize(size_t _n) { n = _n; vertex_to.resize(_n); vertex_from.resize(_n); } }; // PDCA を 0123 に置き換える inline int convert(char c) { return c == 'P' ? 0 : c == 'D' ? 1 : c == 'C' ? 2 : 3; } // 実行速度をちょっと速くした提出 int main() { ll n, m; string label; scanner >> n >> m; scanner >> label; vector group[4]; group[1].reserve(n); group[2].reserve(n); repeat(i, n) { int g = convert(label[i]); if (g == 1 || g == 2) group[g].push_back(i); } DGraph graph(n); repeat(i, m) { int u, v; scanner >> u >> v; --u; --v; if (label[u] < label[v]) swap(u, v); int ul = convert(label[u]); int vl = convert(label[v]); if (ul + 1 != vl) continue; graph.connect(u, v); } vector dp(n); ll ans = 0; // 1->2 (D->C) for (int i : group[1]) { ll deg = ll(graph.vertex_from[i].size()); for (int j : graph.vertex_to[i]) dp[j] = (dp[j] + deg) % MD; } // 2->3 (C->A) for (int i : group[2]) for (int j : graph.vertex_to[i]) ans = (ans + dp[i]) % MD; cout << ans << endl; return 0; }