How to solve matrice crossword ?

[Eivyses]

Hello,
I have a table(matrice) with letter in each slot. i have file with it:
5 7
L a j i n i k
a K a m i n u
i s b i s a C
v i i G a i s
e l n e t t i
4
Kabinetas 2 2
Laivelis 1 1
Giminaitis 4 4
Cukinija 3 7

5 and 7 is matrice size, below is matrice. at the end there are 4 words i have to find and their first letter place in matrice.

My task is to find those 4 words and change matrice, crossed word is changed to number of word like this:
2 4 4 4 4 4 4
2 1 1 3 3 3 4
2 2 1 3 1 3 4
2 2 1 3 1 3 3
2 2 1 1 1 3 3

I did put matrice to class and to double massive (i dont actually know how it is called, but it looks like this: a[i][j];). I do understand that i need to look letters from the first one i have with if and +1 -1 on matrice axis. But problem is, that half word can be to wrong side, so if i go to wrong side, i will have to redo calculations. I understand what i have to do, but im not able to write it in any way. Can you plz get me on the way ?

//------------- First class for matrice letters -------------------------------
/** class for matrice letters
class Raides
{
private:
	char raide;     // matrice letter

public:
	Raides(char Raide = ' '): raide(Raide) {}
	~Raides() {}
	void Deti(char Raide)
	{
		raide = Raide;
	}
	char ImtiRaide() {return raide;}
};

//------------------------- class for looking words -------------------------
#pragma once
#include <string>

using namespace std;

class Ieskoma
{
private:
	string zodis; // ieskomas zodis
	int x; // pozicija eiluteje
	int y; // pozicija stulpelyje
public:
	Ieskoma(): zodis(""), x(0), y(0) {}
	~Ieskoma(){}
	void Deti(string Zodis, int X, int Y)
	{
		zodis = Zodis;
		x = X;
		y = Y;
	}
	string ImtiZodi() {return zodis;}
	int ImtiX() {return x;}
	int ImtiY() {return y;}
};
//------------ conteiner class ----------------------------------
#include "Raides.h"
using namespace std;


/** class for crossword
class Kryziazodis
{
public:
	static const int Ceil = 100; // max number of lines
	static const int Cstulp = 100; // max number of columns
private:
	Raides R[Ceil][Cstulp];
	int n; // lines number
	int m; // columns number
public:
	Kryziazodis(int N = 0, int M = 0): n(N), m(M){}
	~Kryziazodis(){}
	int ImtiN() {return n;}
	int ImtiM() {return m;}
	void DetiN(int N) {n = N;}
	void DetiM(int M) {m = M;}
	void Deti(int i, int j, Raides r) {R[i][j] = r;}
	Raides Imti(int i, int j) {return R[i][j];}
};
//--------------------------------- main file--------------------------
#include "Kryziazodis.h"
#include <string>
#include <iomanip>
#include <fstream>
#include <iostream>
#include "Ieskoma.h"

using namespace std;
const char CDfv[] = "Duom.txt";
const char CRfr[] = "Rezultatai.txt";
const int Cmax = 100; // maximum ammount of words


void Skaityti(const char fv[], Kryziazodis & a, int & k, Ieskoma b[]);
void Spausdinti(const char fr[], Kryziazodis a, int k, Ieskoma b[]);
void RastiZodi(Kryziazodis a, Ieskoma b);

int main()
{
	Kryziazodis a;
	int k = 0; // number of looking words
	Ieskoma b[Cmax];
	Skaityti(CDfv, a, k, b);
	Spausdinti(CRfr, a, k , b);
	for (int i = 0; i < k; i++)
		RastiZodi(a, b[i]);
}

void Skaityti(const char fv[], Kryziazodis & a, int & k, Ieskoma b[])
{
	int n, m, x, y;
	char raide;
	Raides r;
	string zodis;
	ifstream fd(fv);
	fd >> n >> m;
	a.DetiN(n);
	a.DetiM(m);
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
		{
			fd >> raide;
			r.Deti(raide);
			a.Deti(i, j, r);
		}
	fd >> k;
	for (int i = 0; i < k; i++)
	{
		fd >> zodis >> x >> y;
		b[i].Deti(zodis, x, y);
	}
	fd.close();
}

void Spausdinti(const char fr[], Kryziazodis a, int k, Ieskoma b[])
{
	ofstream fd(fr);
	for (int i = 0; i < a.ImtiN(); i++)
	{
		for (int j = 0; j < a.ImtiM(); j++)
			fd << a.Imti(i,j).ImtiRaide() << " ";
		fd << endl;
	}
	cout << a.Imti(2,2).ImtiRaide();
	fd << endl << k << endl;
	for (int i = 0; i < k; i++)
	fd << b[i].ImtiZodi() << " " << b[i].ImtiX() << " " << b[i].ImtiY() << endl;
	fd.close();
}

void RastiZodi(Kryziazodis a, Ieskoma b)
{
	int ilgis = b.ImtiZodi().length();
	char raide[50];
	for (int i = 0; i < ilgis; i++)
		raide[i] = b.ImtiZodi()[i];
	int x = b.ImtiX()-1;
	int y = b.ImtiY()-1;
	int ilg = 0;
	int vietaX[50];
	int vietaY[50];
	char tarp = a.Imti(x,y).ImtiRaide();
	while (ilg != ilgis)
	{
		if (a.Imti(x,y).ImtiRaide() == raide[0])
		{
			vietaX[ilg] = x;
			vietaY[ilg] = y;
			ilg++;
		}
	}
	

} */