#include<iostream>
#include<map>

using namespace std;

int main()
{
  int n,s,m[20];

  while(cin >> n >> s)
    {
      for(int i = 0;i < (2*n);i++)
	cin >> m[i];

      bool table[2*n][s + 1];

      for(int i = 0;i < (2*n);i++)
	table[i][0] = true;

      for(int stone = 1;stone <= s;stone++)
	{
	  for(int i = 0;i < (2*n);i++)
	    {
	      bool flag = false;
	      for(int j = 1;j <= m[i] && stone - j >= 0;j++)
		{
		  if(!table[(i + 1)%(2 * n)][stone - j])
		    {
		      flag = true;
		      break;
		    }
		}
	      table[i][stone] = flag;
	    }
	}

      cout << (table[0][s]?1:0) << endl;
    }
  return 0;
}