#include <iostream>
#include <vector>
#include <queue>
#include <unordered_set>
#include <string>
#include <algorithm>
using namespace std;

string multiply(const string& a, int b) {
	if (b == 0) return "0";
	string res;
	int carry = 0;
	for (int i = a.size() - 1; i >= 0; --i) {
		int product = (a[i] - '0') * b + carry;
		res.push_back(product % 10 + '0');
		carry = product / 10;
	}
	if (carry > 0) {
		res.push_back(carry + '0');
	}
	reverse(res.begin(), res.end());
	size_t start = res.find_first_not_of('0');
	if (start != string::npos) {
		return res.substr(start);
	} else {
		return "0";
	}
}

int main() {
	string n;
	int k;
	cin >> n >> k;

	vector<vector<int>> adj(10);

	for (int i = 0; i < k; ++i) {
		int x, y;
		cin >> x >> y;
		adj[x].push_back(y);
	}

	int size[10];
	for (int d = 0; d < 10; ++d) {
		unordered_set<int> visited;
		queue<int> q;
		q.push(d);
		visited.insert(d);

		while (!q.empty()) {
			int u = q.front();
			q.pop();

			for (int v : adj[u]) {
				if (visited.find(v) == visited.end()) {
					visited.insert(v);
					q.push(v);
				}
			}
		}
		size[d] = visited.size();
	}

	string result = "1";
	for (char c : n) {
		int d = c - '0';
		result = multiply(result, size[d]);
	}

	cout << result << endl;

	return 0;
}