#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 7;

int f[N][N][N], s[N][N];
int fac[N], inv[N], invfac[N];

int Mod, T, n, m;

template <class T = int>
inline T read() {
	char c = getchar();
	bool sign = (c == '-');
	
	while (c < '0' || c > '9')
		c = getchar(), sign |= (c == '-');
	
	T x = 0;
	
	while ('0' <= c && c <= '9')
		x = (x << 1) + (x << 3) + (c & 15), c = getchar();
	
	return sign ? (~x + 1) : x;
}

inline int add(int x, int y) {
	x += y;
	
	if (x >= Mod)
		x -= Mod;
	
	return x;
}

inline void prework() {
	fac[0] = fac[1] = 1;
	inv[0] = inv[1] = 1;
	invfac[0] = invfac[1] = 1;

	for (int i = 2; i < N; ++i) {
		fac[i] = 1ll * fac[i - 1] * i % Mod;
		inv[i] = 1ll * (Mod - Mod / i) * inv[Mod % i] % Mod;
		invfac[i] = 1ll * invfac[i - 1] * inv[i] % Mod;
	}
}

signed main() {
	Mod = read(), T = read();
	prework();
	f[1][1][0] = 1;

	for (int i = 1; i + 1 < N; ++i)
		for (int j = 1; j <= i; ++j)
			for (int k = 0; k <= j; ++k) {
				if (k)
					f[i + 1][j][k] = add(f[i + 1][j][k], f[i][j][k]); // 放一个 k

				for (int x = k; x < j; ++x) { // 放一个恰好比 x 大的数
					f[i + 1][j][x] = add(f[i + 1][j][x], f[i][j][k]); // 放一个出现过的数
					f[i + 1][j + 1][x] = add(f[i + 1][j + 1][x], f[i][j][k]); // 放一个没出现的数
				}

				f[i + 1][j + 1][j] = add(f[i + 1][j + 1][j], f[i][j][k]); // 放一个比所有数都大的数
			}

	for (int i = 1; i < N; ++i)
		for (int j = 1; j <= i; ++j)
			for (int k = 0; k <= j; ++k)
				s[i][j] = add(s[i][j], f[i][j][k]);

	while (T--) {
		n = read(), m = read() + 1;
		int ans = 0, mul = 1;

		for (int i = 1; i <= min(n, m); ++i) {
			mul = 1ll * mul * (m - i + 1) % Mod;
			ans = add(ans, 1ll * mul * invfac[i] % Mod * s[n][i] % Mod);
		}

		printf("%d\n", ans);
	}

	return 0;
}