#include <bits/stdc++.h>
using namespace std;
int main() {
    int L, R;
    cin >> L >> R;
    // Test: manually construct minimal DAG for [5,7]
    // 5=101, 6=110, 7=111
    // Optimal: 5 nodes
    // START->1->A, A->0->B, A->1->C, B->1->END, C->0->END, C->1->END
    if (L == 5 && R == 7) {
        cout << 5 << "\n";
        // 1=START, 2=A, 3=B, 4=C, 5=END
        cout << "1 2 1\n";   // START -> A with weight 1
        cout << "2 3 0 4 1\n"; // A -> B:0, C:1
        cout << "1 5 1\n";   // B -> END:1
        cout << "2 5 0 5 1\n"; // C -> END:0, END:1
        cout << "0\n";        // END
    }
    return 0;
}