IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) B. Bear and Compressing 暴力

题意：你需要构造一个长度为n的串，通过n-1次操作得到一个只有a的串，问有多少种原串符合的

思路：由于n只有6，所以直接暴力dfs就可以了

#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 65000
#define LL long long
int cas=1,T;
int n,q;
int ans =0;
vector<int>a;
int x[50],y[50],z[50];
void dfs(int x1)
{
	if (x1==n)
	{
		int flag=0;
		int now = a[0];
		for (int i = 1;i<a.size();i++)
		{
			int flag1=1;
			for (int j = 0;j<q;j++)
			{
				if (now==x[j]&& a[i]==y[j])
				{
					flag1=0;
					now=z[j];
					break;
				}
			}
			if (flag1)
				return;
		}
		if (!now)ans++;
		return;
	}
	for (int i = 0;i<6;i++)
	{
		a.push_back(i);
		dfs(x1+1);
        a.pop_back();
	}
}
int main()
{
	//freopen("in","r",stdin);
	//scanf("%d",&T);
	while (scanf("%d%d",&n,&q)!=EOF)
	{
   	    for (int i = 0;i<q;i++)
		{
			string x1,y1;
			cin >> x1 >> y1;
			x[i]=(int)(x1[0]-'a');
			y[i]=(int)(x1[1]-'a');
			z[i]=(int)(y1[0]-'a');
		}
		dfs(0);
	    printf("%d\n",ans);
	}
	//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}

Description

Limak is a little polar bear. Polar bears hate long strings and thus they like to compress them. You should also know that Limak is so young that he knows only first six letters of the English alphabet: 'a', 'b', 'c', 'd', 'e' and 'f'.

You are given a set of q possible operations. Limak can perform them in any order, any operation may be applied any number of times. The i-th operation is described by a string a_i of length two and a string b_i of length one. No two of q possible operations have the same string a_i.

When Limak has a string s he can perform the i-th operation on s if the first two letters of s match a two-letter string a_i. Performing thei-th operation removes first two letters of s and inserts there a string b_i. See the notes section for further clarification.

You may note that performing an operation decreases the length of a string s exactly by 1. Also, for some sets of operations there may be a string that cannot be compressed any further, because the first two letters don't match any a_i.

Limak wants to start with a string of length n and perform n - 1 operations to finally get a one-letter string "a". In how many ways can he choose the starting string to be able to get "a"? Remember that Limak can use only letters he knows.

Input

The first line contains two integers n and q (2 ≤ n ≤ 6, 1 ≤ q ≤ 36) — the length of the initial string and the number of available operations.

The next q lines describe the possible operations. The i-th of them contains two strings a_i and b_i (|a_i| = 2, |b_i| = 1). It's guaranteed thata_i ≠ a_j for i ≠ j and that all a_i and b_i consist of only first six lowercase English letters.

Output

Print the number of strings of length n that Limak will be able to transform to string "a" by applying only operations given in the input.

Sample Input

Input

3 5
ab a
cc c
ca a
ee c
ff d

Output

4

Input

2 8
af e
dc d
cc f
bc b
da b
eb a
bb b
ff c

Output

1

Input

6 2
bb a
ba a

Output

0