/*
DP
*/
// include file
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <ctime>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <bitset>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <list>
#include <functional>
using namespace std;
// typedef
typedef __int64 LL;
//
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
#define Z(a,b) ((a)<<(b))
#define Y(a,b) ((a)>>(b))
const double eps = 1e-6;
const double INFf = 1e100;
const int INFi = 1000000000;
const LL INFll = (LL)1<<62;
const double Pi = acos(-1.0);
template<class T> inline T sqr(T a){return a*a;}
template<class T> inline T TMAX(T x,T y)
{
if(x>y) return x;
return y;
}
template<class T> inline T TMIN(T x,T y)
{
if(x<y) return x;
return y;
}
template<class T> inline T MMAX(T x,T y,T z)
{
return TMAX(TMAX(x,y),z);
}
template<class T> inline T MMIN(T x,T y,T z)
{
return TMIN(TMIN(x,y),z);
}
template<class T> inline void SWAP(T &x,T &y)
{
T t = x;
x = y;
y = t;
}
// code begin
int T,base,year,bonds;
struct node
{
int v;
int c;
};
node pac[13];
int DP[46000];
int main()
{
read;
write;
int Max;
scanf("%d",&T);
while(T--)
{
scanf("%d %d",&base,&year);
scanf("%d",&bonds);
Max = 0;
for(int i=0;i<bonds;i++)
{
scanf("%d %d",&pac[i].v,&pac[i].c);
pac[i].v/=1000;
if(pac[i].v>Max) Max=pac[i].v;
}
int start = base,up,pre= 0;
memset(DP,0,sizeof(DP));
for(int i=0;i<year;i++)
{
up = start/1000;
for(int j=0;j<bonds;j++)
{
for(int k=pre;k<=up;k++)
{
if(k+pac[j].v>up) break;
DP[k+pac[j].v] = TMAX(DP[k+pac[j].v],DP[k]+pac[j].c);
}
}
pre = (up-Max<0)?0:(up-Max);
start += DP[up];
}
printf("%d\n",start);
}
return 0;
}