#include<cstdio>

 #include<algorithm>

 #include<cstring>

 using namespace std;

 bool visit[];

 int prime[];

 int f[][];

 int prime_num = ;

 void generate_prim(int n) {

     memset(visit, true, sizeof(visit));

     for (int i = ; i <= n; ++i) {

         if (visit[i] == true) prime[++prime_num] = i;

         for (int j = ; ((j <= prime_num) && (i * prime[j] <= n)); ++j) {

             visit[i * prime[j]] = false;

             if (i % prime[j] == ) break;

         }

     }

     return;

 }

 void generate_plan() {

     generate_prim();

     f[][] = ;

     for (int k= ; k < prime_num; k++) {

         for (int i = ; i >= ; i--) {

             int UP = lower_bound(prime, prime + k, i) - prime + ;

             for (int j = ; j < UP; j++) {

                 if (prime[k] > i)break;

                 f[i][j] += f[i - prime[k]][j - ];

             }

         }

     }

     return;

 }

 int main() {

     generate_plan();

     int n, m;

     while (scanf("%d%d", &n, &m) && n&&m) {

         printf("%d\n", f[n][m]);

     }

     return ;

 }