// Problem D  Ver. 1.0
// Coding & Debug : 30min

#include <stdio.h>
#define MAX 1130

int primes;
int prime[MAX];

// Cache
int table[MAX][200][16]; // primes:189
int flag[MAX][200][16];

void mktable()
{
	int isprime[MAX];
	int i,j;
	for (i=0;i<MAX;i++) isprime[i] = 1;
	isprime[0] = 0;
	isprime[1] = 0;
	for (i=2;i<MAX;i++) {
		if (isprime[i]) {
			for (j=i*2;j<MAX;j+=i) isprime[j] = 0;
		}
	}

	primes = 0;
	for (i=2;i<MAX;i++) {
		if (isprime[i]) prime[primes++] = i;
	}

}

int solv(int count,int left,int p)
{
	int a=0,k=p;
	
	if (!count) return left==0;
	if (flag[left][p][count]) return table[left][p][count];

	for (;p<primes;p++) {
		if (left<prime[p]) break;
		a+=solv(count-1,left-prime[p],p+1);
	}
	flag[left][k][count] = 1;
	table[left][k][count] = a;
	return a;
}

int main()
{
	FILE *fp = fopen("D.txt","r");
	int n,count;
	mktable();

	while(fscanf(fp,"%d %d",&n,&count) && n)
		printf("%d\n",solv(count,n,0));

	return 0;
}