Matrix-Search-Efficient

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Example usage
        int[][] X = {
            {1, 2, 3},
            {4, 5, 6},
            {7, 8, 9}
        };
        int k = 5;
        Pair<Integer, Integer> result = find(X, k);
        if (result.getKey() == -1 && result.getValue() == -1) {
            System.out.println("Element not found.");
        } else {
            System.out.printf("Element found at position (%d, %d).\n", result.getKey(), result.getValue());
        }
    }

    public static Pair<Integer, Integer> find(int[][] X, int k) {
        int n = X.length;
        int m = X[0].length;
        int a = 0;
        int b = m - 1;
        while (a < n && b >= 0) {
            if (X[a][b] == k) {
                break;
            } else if (X[a][b] < k) {
                a += 1;
            } else {
                b -= 1;
            }
        }
        if (a >= n || b < 0) {
            return new Pair<>(-1, -1);  // not found
        }
        return new Pair<>(a, b);
    }
}