#include<iostream>

using namespace std;

long long powMod(long long a, long long n, long long p)
{
	long long ans = 1;
	for (; n > 0; n >>= 1)
	{
		if (n & 1)
			ans = ans * a%p;
		a = a * a%p;
	}
	return ans;
}
int main()
{
	int t, n, m, a, b;
	
	cin >> t;
	while (t--)
	{
		cin >> m >> n;
		long long sum = 0;
		while (n--)
		{
			cin >> a >> b;
			long long sum1 = powMod(a, b, m);
			sum = (sum + sum1) % m;
		}
		cout << sum << endl;
	}
}