#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <map>
#include <set>
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;

int RB(int r, int b, vector <int> &N)
{
  long long R, B;
  int i, j;

  R = 0;
  for (i = 0; i < N.size(); i++) R += N[i];
  if (R != r + b) return 0;

  for (i = 0; i < (1 << N.size()); i++) {
    R = 0;
    B = 0;
    for (j = 0; j < N.size(); j++) {
      if (i & (1 << j)) {
        R += N[j];
      } else {
        B += N[j];
      }
    }
    if (R == r && B == b) return 1;
  }
  return 0;
}

main()
{
  int r, b, i;
  vector <int> N;

  cin >> r >> b;
  while (cin >> i) N.push_back(i);
  printf("%d\n", RB(r, b, N));
  exit(0);
}