Is It possible?

You are given A days in a year, numbered from 1 to A.
You must complete M different types of work, each with its own deadline and required duration.

You are given a 2D array B of size M × 3, where each row represents a work type:

- B[i][0] → The day on which the work is assigned
- B[i][1] → The deadline day (the work must be completed before this day)
- B[i][2] → The number of days required to complete this work

> Work types are numbered from 1 to M.

---

## 📅 Rules for Each Day

On any given day, only one of the following actions can be performed:

1. Rest — No work is done.
2. Deadline Day — If today is the deadline day (B[i][1]) for any work, no work can be done on this day.
3. Work — Perform one unit of work for exactly one work type.

---

## ⚠️ Important Notes

- On any day, there will be at most one deadline.
- If multiple work types are available on a day, you must prioritize the work with the earliest deadline.
- A work type must be fully completed before its deadline.
- You cannot perform any work on a deadline day.

---

## 🎯 Objective

Determine whether it is possible to complete all M work types within the given constraints.

---

## 📤 Output Format

- If it is not possible to complete all work, return: -1
- Otherwise, return a vector of size A + 1:
- result[0] = 1
- For each day d (1 ≤ d ≤ A):
- 0 → Rest day
- M + 1 → Deadline day
- x (1 ≤ x ≤ M) → Work of type x is performed on day d