Write a program to determine if the current configuration of a Tic Tac Toe board allows the 'X' player to win on their next move. A winning configuration is one where three 'X's appear in a row. Your task is to find if there is a row, column, or diagonal with exactly two 'X's and an empty spot, indicating that 'X' can win by playing in that spot. The program should output the coordinate (x, y) of the winning location.