#include <bits/stdc++.h>
using namespace std;
void XsliferX() {
  ios::sync_with_stdio(0);
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
}
int dx[9] = {1, -1, 0, 0, 1, -1, 1, -1, 0};
int dy[9] = {0, 0, 1, -1, 1, -1, -1, 1, 0};
const int INF = 2000000000;
struct Edge {
  int from, to, cap, flow, index;
  Edge(int from, int to, int cap, int flow, int index)
      : from(from), to(to), cap(cap), flow(flow), index(index) {}
};
struct Dinic {
  int N;
  vector<vector<Edge>> G;
  vector<Edge *> dad;
  vector<int> Q;
  Dinic(int N) : N(N), G(N), dad(N), Q(N) {}
  void AddEdge(int from, int to, int cap) {
    G[from].push_back(Edge(from, to, cap, 0, G[to].size()));
    if (from == to) G[from].back().index++;
    G[to].push_back(Edge(to, from, 0, 0, G[from].size() - 1));
  }
  long long BlockingFlow(int s, int t) {
    fill(dad.begin(), dad.end(), (Edge *)NULL);
    dad[s] = &G[0][0] - 1;
    int head = 0, tail = 0;
    Q[tail++] = s;
    while (head < tail) {
      int x = Q[head++];
      for (int i = 0; i < G[x].size(); i++) {
        Edge &e = G[x][i];
        if (!dad[e.to] && e.cap - e.flow > 0) {
          dad[e.to] = &G[x][i];
          Q[tail++] = e.to;
        }
      }
    }
    if (!dad[t]) return 0;
    long long totflow = 0;
    for (int i = 0; i < G[t].size(); i++) {
      Edge *start = &G[G[t][i].to][G[t][i].index];
      int amt = INF;
      for (Edge *e = start; amt && e != dad[s]; e = dad[e->from]) {
        if (!e) {
          amt = 0;
          break;
        }
        amt = min(amt, e->cap - e->flow);
      }
      if (amt == 0) continue;
      for (Edge *e = start; amt && e != dad[s]; e = dad[e->from]) {
        e->flow += amt;
        G[e->to][e->index].flow -= amt;
      }
      totflow += amt;
    }
    return totflow;
  }
  long long GetMaxFlow(int s, int t) {
    long long totflow = 0;
    while (long long flow = BlockingFlow(s, t)) totflow += flow;
    return totflow;
  }
};
bool isprime(int x) {
  for (int i = 2; i * i <= x; i++)
    if (x % i == 0) return false;
  return true;
}
vector<pair<int, int>> v[101], odd, even;
int ind[10005];
int main() {
  XsliferX();
  int n, kk;
  cin >> n >> kk;
  for (int i = 0; i < n; i++) {
    int x, y, z;
    cin >> x >> y >> z;
    v[z].push_back({x, y});
  }
  int mx = -1;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < v[i].size(); j++) {
      if (v[i][j].second & 1) {
        if (v[i][j].second != 1)
          odd.push_back(v[i][j]);
        else
          mx = max(mx, v[i][j].first);
      } else
        even.push_back(v[i][j]);
    }
    Dinic d(300);
    int src = 250, think = 255, one = 200;
    int sum = 0;
    if (mx != -1) {
      sum += mx;
      d.AddEdge(src, one, mx);
      for (int j = 0; j < even.size(); j++) {
        if (isprime(even[j].second + 1)) d.AddEdge(one, j + 100, 1e9);
      }
    }
    for (int j = 0; j < even.size(); j++) {
      sum += even[j].first;
      d.AddEdge(j + 100, think, even[j].first);
    }
    for (int j = 0; j < odd.size(); j++) {
      sum += odd[j].first;
      d.AddEdge(src, j, odd[j].first);
    }
    for (int j = 0; j < even.size(); j++) {
      for (int k = 0; k < odd.size(); k++) {
        if (isprime(even[j].second + odd[k].second)) d.AddEdge(k, j + 100, 1e9);
      }
    }
    if (sum - d.GetMaxFlow(src, think) >= kk) return cout << i, 0;
  }
  cout << -1;
  return 0;
}
